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.
@article{bwmeta1.element.doi-10_7151_dmgt_1872,
author = {Xiaoyun Lu and Douglas B. West},
title = {A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {555-564},
zbl = {1339.05076},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1872}
}
Xiaoyun Lu; Douglas B. West. A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 555-564. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1872/
[1] C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176. doi:10.1002/jgt.3190070205[Crossref] | Zbl 0515.05040
[2] W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116. doi:10.1090/S0002-9947-1956-0081471-8[Crossref] | Zbl 0070.18403
[3] H. Whitney, A theorem on graphs, Ann. of Math. 32 (1931) 378-390. doi:10.2307/1968197[Crossref] | Zbl 0002.16101