Abstract
LetGbe a 2-edge-connected graph withmedges andnvertices. The following two conjectures are proved in this paper. (i) The edges ofGcan be covered by circuits of total length at mostm+n−1. (ii) The vertices ofGcan be covered by circuits of total length at most 2(n−1), wheren⩾2.
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.
