论文信息 - Non-intersecting perfect matchings in cubic graphs

Non-intersecting perfect matchings in cubic graphs

A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. We use this method to prove a special case of a conjecture of E. Máčajová and M. Škoviera on Fano colorings of cubic graphs.

André Raspaud | Tomáš Kaiser

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

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

[3] Cun-Quan Zhang. Integer Flows and Cycle Covers of Graphs , 1997 .

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

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

[6] Herbert Fleischner,et al. Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen , 1976 .

[7] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[8] Fred C. Holroyd,et al. Colouring of cubic graphs by Steiner triple systems , 2004, J. Comb. Theory, Ser. B.