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

DOI10.1016/S0012-365X(98)00089-2zbMATH Open0958.05085MaRDI QIDQ1584430FDOQ1584430

Jochen Harant, T. 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)

Cites Work

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

Cited In (6)

• Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
• On Hamilton cycles in certain planar graphs
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Non-Hamiltonian triangulations with distant separating triangles
• Title not available (Why is that?)
• Non-Hamiltonian 1-tough triangulations with disjoint separating triangles

Recommendations

• Hamilton cycles in plane triangulations 👍 👎
• On certain Hamiltonian cycles in planar graphs 👍 👎
• On Hamilton cycles in certain planar graphs 👍 👎
• Cycles in 5-connected triangulations 👍 👎
• Counting Hamiltonian cycles in planar triangulations 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584430)