The equivalence of two conjectures of Be
โ
G. Mazzuoccolo
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 65 KB
Let G be a bridgeless cubic graph. Fulkerson conjectured that there exist six 1-factors of G such that each edge of G is contained in exactly two of them. Berge conjectured that the edge-set of G can be covered with at most five 1-factors. We prove that the two conjectures are equivalent.