论文信息 - New conjectures on perfect matchings in cubic graphs

New conjectures on perfect matchings in cubic graphs

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.

Giuseppe Mazzuoccolo

[1] André Raspaud,et al. Fulkerson's Conjecture and Circuit Covers , 1994, J. Comb. Theory, Ser. B.

[2] Romeo Rizzi,et al. Excessive factorizations of bipartite multigraphs , 2010, Discret. Appl. Math..

[3] Vahan V. Mkrtchyan,et al. On disjoint matchings in cubic graphs , 2008, Discret. Math..

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

[5] Eckhard Steffen. 1-Factor and Cycle Covers of Cubic Graphs , 2015, J. Graph Theory.

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

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

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

[9] Xiaofeng Wang,et al. A note on Berge-Fulkerson coloring , 2009, Discret. Math..

[10] André Raspaud,et al. Perfect matchings with restricted intersection in cubic graphs , 2010, Eur. J. Comb..