On Hamiltonian cycles in 4- and 5-connected plane triangulations

DOI10.1016/S0012-365X(98)00089-2zbMath0958.05085MaRDI QIDQ1584430

Jochen Harant, Thomas Böhme

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleplane triangulation

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Non-Hamiltonian triangulations with distant separating triangles ⋮ Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Non-Hamiltonian 1-tough triangulations with disjoint separating triangles

Cites Work

• Bridges and Hamiltonian circuits in planar graphs
• 4-connected projective planar graphs are Hamiltonian
• A Theorem on Planar Graphs
• Hamiltonian cycles in planar triangulations with no separating triangles
• Hamiltonicity of 5‐Connected Toroidal Triangulations
• On Hamilton cycles in certain planar graphs
• A theorem on paths in planar graphs

This page was built for publication: On Hamiltonian cycles in 4- and 5-connected plane triangulations