A new proof that 4-connected planar graphs are Hamiltonian-connected

Xiaoyun Lu, Douglas B. West · Discussiones Mathematicae Graph Theory · 2016

We prove a theorem guaranteeing special paths of faces in 2-connected plane graphs. As a corollary, we obtain a new proof of Thomassen's theorem that every 4-connected planar graph is Hamiltonian-connected.

Read the paper · More papers on PaperTik