Abstract
Thomassen proved that 4-connected planar graphs are Hamilton connected by showing that every 2-connected planar graph G contains a Tutte path P between any two given vertices, that is, every component of G−P has at most three neighbors on P. In this paper, we prove a quantitative version of this result for circuit graphs, a natural class of planar graphs which includes all 3-connected planar graphs, by further controlling the number of components in G−P. We also give an application of this result by providing a best possible bound for the circumference of essentially 4-connected planar graphs.
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.
