Covering cubic graphs with matchings of large size

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 number is called excessive [m]-index of G in literature. The case m=n, that is a covering with perfect matchings, is known to be strictly related to an outstanding conjecture of Berge and Fulkerson. In this paper we study in some details the case m=n-1. We show how this parameter can be large for cubic graphs with low connectivity and we furnish some evidence that each cyclically 4-connected cubic graph of order 2n has excessive [n-1]-index at most 4. Finally, we discuss the relation between excessive [n-1]-index and some other graph parameters as oddness and circumference.

[1]  Hung-Lin Fu,et al.  On minimum sets of 1-factors covering a complete multipartite graph , 2008, J. Graph Theory.

[2]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[3]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[4]  David Cariolaro,et al.  Excessive Factorizations of Regular Graphs , 2006 .

[5]  Hung-Lin Fu,et al.  Covering graphs with matchings of fixed size , 2010, Discret. Math..

[6]  Klas Markström,et al.  Generation and properties of snarks , 2012, J. Comb. Theory B.

[7]  P. D. Seymour,et al.  On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte , 1979 .

[8]  Giuseppe Mazzuoccolo.  The equivalence of two conjectures of Berge and Fulkerson , 2011, J. Graph Theory.

[9]  Giuseppe Mazzuoccolo.  Covering a 3-graph with perfect matchings , 2011 .

[10]  Edita Mácajová,et al.  Fano colourings of cubic graphs and the Fulkerson Conjecture , 2005, Theor. Comput. Sci..

[11]  Jean-Marie Vanherpe,et al.  On the perfect matching index of bridgeless cubic graphs , 2009, ArXiv.

[12]  Hung-Lin Fu,et al.  The Excessive [3]-Index of All Graphs , 2009, Electron. J. Comb..

[13]  Jean-Marie Vanherpe,et al.  On Fulkerson conjecture , 2011, Discuss. Math. Graph Theory.

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  Giuseppe Mazzuoccolo.  Covering a cubic graph with perfect matchings , 2013, Discret. Math..

[16]  Giuseppe Mazzuoccolo.  An Upper Bound for the Excessive Index of an r-Graph , 2013, J. Graph Theory.

[17]  William J. Cook,et al.  Combinatorial optimization , 1997 .