Abstract
Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most |E(G)| + |V(G)| − 3 and that, if G is a minimally 2-edge connected graph, then the length is at most 2|V(G)| − 2. We then deduce results concerning the length of a shortest cycle cover for graphs containing no subdivision of the Petersen graph.
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.
