Title of article
Small cycle covers of 3-connected cubic graphs
Author/Authors
Yang، نويسنده , , Fan-ping Li، نويسنده , , Xiangwen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
11
From page
186
To page
196
Abstract
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.
Keywords
Cyclically- k -edge-connected graphs , cubic graphs , Cycle cover
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598376
Link To Document