Bipartizing matchings and Sabidussi's compatibility conjecture
AbstractIn 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
Publisher: Elsevier Science B.V.
DOI identifier: 10.1016/S0012-365X(01)00076-0
Sorry, we are unable to provide the full text but you may find it at the