Abstract
AbstractThe 5‐even subgraph cycle double cover conjecture (5‐CDC conjecture) asserts that every bridgeless graph has a 5‐even subgraph double cover. A shortest even subgraph cover of a graph is a family of even subgraphs which cover all the edges of and the sum of their lengths is minimum. It is conjectured that every bridgeless graph has an even subgraph cover with total length at most . In this paper, we study those two conjectures for weak oddness 2 cubic graphs and present a sufficient condition for such graphs to have a 5‐CDC containing a member with many vertices. As a corollary, we show that for every oddness 2 cubic graph satisfying the sufficient condition has a 4‐even subgraph ‐cover with total length at most . We also show that every oddness 2 cubic graph with girth at least 30 has a 5‐CDC containing a member of length at least and thus it has a 4‐even subgraph ‐cover with total length at most .
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
