Small cycle covers of 3-connected cubic graphs

Let G be a 3-connected simple cubic graph on n ≥ 8 vertices. It is proved in this paper that G admits a cycle cover of size at most ⌈ n / 6 ⌉ if and only if G is not one of the five specified graphs.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 311; no. 2; pp. 186 - 196
Main Authors Yang, Fan, Li, Xiangwen
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier B.V 06.02.2011
Elsevier
Subjects
Algebra
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Cubic graphs
Cycle cover
Cyclically- [formula omitted]-edge-connected graphs
Exact sciences and technology
Information retrieval. Graph
Mathematics
Sciences and techniques of general use
Theoretical computing
Cyclically- k -edge-connected graphs
Cubic graphs
Cycle cover
Edge(graph)
Cyclically-k-edge-connected graphs
Cubic graph
Discrete mathematics
Connected graph
Combinatorics
Online AccessGet full text

Cover

More Information
Summary:Let G be a 3-connected simple cubic graph on n ≥ 8 vertices. It is proved in this paper that G admits a cycle cover of size at most ⌈ n / 6 ⌉ if and only if G is not one of the five specified graphs.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2010.10.013