On the 2-extendability of planar graphs

Some sufficient conditions for the 2-extendability of k-connected k-regular ( k⩾3) planar graphs are given. In particular, it is proved that for k⩾3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 96; no. 2; pp. 81 - 99
Main Authors Holton, D.A., Lou, Dingjun, Plummer, Michael D.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 05.12.1991
Elsevier
Subjects
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Extension
Connected graph
Sufficient condition
Planar graph
Cut set
Online AccessGet full text

Cover

More Information
Summary:Some sufficient conditions for the 2-extendability of k-connected k-regular ( k⩾3) planar graphs are given. In particular, it is proved that for k⩾3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable.
ISSN:0012-365X
1872-681X
DOI:10.1016/0012-365X(91)90227-S