| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648819 | Discrete Mathematics | 2011 | 11 Pages |
Abstract
Let GG be a 3-connected simple cubic graph on n≥8n≥8 vertices. It is proved in this paper that GG admits a cycle cover of size at most ⌈n/6⌉⌈n/6⌉ if and only if GG is not one of the five specified graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fan Yang, Xiangwen Li,