Abstract
Define two binary matroids on the same element set to be mutually semi-dual if every cocycle of one of them is a cycle of the other. We observe that the cycle double cover (CDC) conjecture is equivalent to the following statement: Every bridgeless regular matroid has a loopless graphic semi-dual. This observation is used to construct CDCs for some families of graphs. The main result: Every bridgeless multigraph which contains a Hamiltonian path has a CDC consisting of at most 6 Eulerian subgraphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
