Non-Hamiltonian triangulations with distant separating triangles

DOI10.1016/j.disc.2018.03.018zbMath1387.05141OpenAlexW2797536331MaRDI QIDQ1752660

Kenta Ozeki, Carol T. Zamfirescu

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.03.018

zbMATH Keywords

triangulationnon-Hamiltonianseparating triangle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Non-Hamiltonian 1-tough triangulations with disjoint separating triangles

Cites Work

• Unnamed Item
• A 1-tough nonhamiltonian maximal planar graph
• 4-connected projective planar graphs are Hamiltonian
• On Hamiltonian cycles in 4- and 5-connected plane triangulations
• Tough graphs and Hamiltonian circuits. (Reprint)
• A Theorem on Planar Graphs
• On certain Hamiltonian cycles in planar graphs
• Hamilton cycles in plane triangulations

This page was built for publication: Non-Hamiltonian triangulations with distant separating triangles