Hamilton cycles in maximal planar graphs

DOI10.1016/J.ENDM.2006.06.092MaRDI QIDQ3439476zbMATH OpenOpenAlexFDO

Authors Guido Helde, Oliver Vieten

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.092

zbMATH Keywords

Hamilton cyclemaximal planar graphseparating triangle

Mathematics Subject Classification ID

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

Recommendations

• Each maximal planar graph with exactly two separating triangles is Hamiltonian
• Hamiltonian cycles in planar triangulations with no separating triangles
• Any maximal planar graph with only one separating triangle is Hamiltonian
• Hamilton cycles in plane triangulations
• Extension of a theorem of Whitney

Cited in

(14)

• Any maximal planar graph with only one separating triangle is Hamiltonian
• Hamilton cycles in planar graphs and Venn diagrams
• Each maximal planar graph with exactly two separating triangles is Hamiltonian
• Extension of a theorem of Whitney
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Hamiltonian Paths and Cycles in Planar Graphs
• Hamilton Cycles in Planar Locally Finite Graphs
• scientific article; zbMATH DE number 4101250 (Why is no real title available?)
• Hamiltonian cycles in planar triangulations with no separating triangles
• On certain Hamiltonian cycles in planar graphs
• scientific article; zbMATH DE number 1744075 (Why is no real title available?)
• scientific article; zbMATH DE number 889961 (Why is no real title available?)
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

This page was built for publication: Hamilton cycles in maximal planar graphs

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