Abstract
We prove that every simple bridgeless cubic graph with $n \ge 8$ vertices has a traveling salesman tour of length at most $1.3\cdot n - 2$, which can be constructed in polynomial time.MSC codestraveling salesman problemgraphic TSPcubic graphsMSC codes05C3868R1090C27
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.
