Abstract
A graph is said to be Hamiltonian-connected if there exists a Hamiltonian path between any given pair of distinct vertices. In 1983, Thomassen proved that every 4-connected plane graph is Hamiltonian-connected, using the concept of Tutte subgraph. In this paper, we give a new proof to Thomassen’s theorem.
Funding Statement
This work was in part supported by JSPS KAKENHI Grant Number 25871053 and by Grant for Basic Science Research Projects from The Sumitomo Foundation.
Acknowledgments
We thank the referee for helpful comments and suggestions for our paper.
Citation
Kenta Ozeki. "A shorter proof of Thomassen’s theorem on Tutte paths in plane graphs." SUT J. Math. 50 (2) 417 - 425, June 2014. https://doi.org/10.55937/sut/1424794984
Information
