Each maximal planar graph with exactly two separating triangles is Hamiltonian

DOI10.1016/j.dam.2007.03.018zbMath1123.05059OpenAlexW1966802404MaRDI QIDQ2383540

Guido Helden

Publication date: 19 September 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.018

zbMATH Keywords

Hamilton cyclemaximal planar graphseparating triangle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Two-page book embeddings of 4-planar graphs ⋮ A survey on book-embedding of planar graphs ⋮ On Jones' subgroup of R. Thompson group \(F\) ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ An Experimental Study on Generating Planar Graphs ⋮ Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey

Cites Work

• Unnamed Item
• Planar graphs: Theory and algorithms
• Any maximal planar graph with only one separating triangle is Hamiltonian
• A Theorem on Planar Graphs
• The Planar Hamiltonian Circuit Problem is NP-Complete