A shorter proof of Thomassen’s theorem on Tutte paths in plane graphs
Kenta Ozeki · SUT Journal of Mathematics · 2014
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.