Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call