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

DOI10.7151/DMGT.1872zbMath1339.05076OpenAlexW2327688727MaRDI QIDQ726634

Douglas B. West, Xiao-Yun Lu

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1872

zbMATH Keywords

Hamiltonian-connected4-connected planar graphTutte-path

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Connectivity and some other properties of generalized Sierpiński graphs

Cites Work

• A Theorem on Planar Graphs
• A theorem on paths in planar graphs

This page was built for publication: A new proof that 4-connected planar graphs are Hamiltonian-connected