Covering a cubic graph with perfect matchings

Giuseppe Mazzuoccolo

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is cont…