Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9515952 | Journal of Combinatorial Theory, Series B | 2005 | 27 Pages |
Abstract
We prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles has a cycle double cover.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roland Häggkvist, Sean McGuinness,