| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652850 | Electronic Notes in Discrete Mathematics | 2007 | 7 Pages |
Abstract
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. The method can be used to prove a special case of a conjecture of E. Máčajová and M. Škoviera on Fano colorings of cubic graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
