| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652344 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
We show that every bridgeless cubic graph having a 2-factor with at most two odd circuits admits three perfect matchings with no common edge. This partially verifies a conjecture of Fan and Raspaud (1994) and supports Fulkerson's conjecture (1971).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
