| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652236 | Electronic Notes in Discrete Mathematics | 2013 | 4 Pages |
Abstract
We propose three new conjectures on perfect matchings in cubic graphs. The weakest conjecture is implied by a well-known conjecture of Berge and Fulkerson. The other two conjectures are a strengthening of the first one. All conjectures are trivially verified for 3-edge-colorable cubic graphs and by computer for all snarks of order at most 34.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
