论文信息 - Bipartizing matchings and Sabidussi's compatibility conjecture

Bipartizing matchings and Sabidussi's compatibility conjecture

In a cubic graph G3 with dominating cycle C, a matching M is called bipartizing if M ∩ E(C) = φ, M covers all of V(G3)- V(C), and G3 - M is homeomorphic to a cubic bipartite graph. In this note it will be shown that if G3 has two disjoint bipartizing matchings, then G3 has a cycle double cover S with C ∈ S.

Herbert Fleischner | H. Fleischner

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Herbert Fleischner,et al. (Some of) the many uses of Eulerian graphs in graph theory (plus some applications) , 2001, Discret. Math..

[3] Michael Stiebitz,et al. A solution to a colouring problem of P. Erdös , 1992, Discret. Math..

[4] Herbert Fleischner. Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs , 1994, J. Graph Theory.

[5] H. Fleischner. Eulerian graphs and related topics , 1990 .

[6] A. Kotzig. Moves Without Forbidden Transitions in a Graph , 1968 .