Covering cubic graphs with matchings of large size

Simona Bonvicini, Giuseppe Mazzuoccolo

Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This numbe…