Title

A chain theorem for 4-connected graphs

Document Type

Article

Publication Date

1-1-2019

Abstract

A sequence of 4-connected graphs G0,G1,.,Gn is called a (G0,Gn)-chain if each Gi (i

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

341

Last Page

349

This document is currently not available here.

Share

COinS