Abstract
AbstractIn this article, we show that for any simple, bridgeless graph G on n vertices, there is a family 𝒞 of at most n−1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and ε edges having cogirth g*⩾3 and k(G) components, there is a family of at most ε−n+k(G) cocycles which cover the edges of G at least twice. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 270–284, 2010
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 callDisclaimer: 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.
