Non-Hamiltonian 1-tough triangulations with disjoint separating triangles

DOI10.1016/j.dam.2020.03.053zbMath1443.05108OpenAlexW3015664627MaRDI QIDQ777448

Carol T. Zamfirescu, Jun Fujisawa

Publication date: 7 July 2020

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

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

zbMATH Keywords

triangulationnon-Hamiltonian1-toughseparating triangle

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• A 1-tough nonhamiltonian maximal planar graph
• 4-connected projective planar graphs are Hamiltonian
• On Hamiltonian cycles in 4- and 5-connected plane triangulations
• Polyhedra with few 3-cuts are Hamiltonian
• Non-Hamiltonian triangulations with distant separating triangles
• On the shortness exponent of 1-tough, maximal planar graphs
• Tough graphs and Hamiltonian circuits.
• Hamilton cycles in plane triangulations

This page was built for publication: Non-Hamiltonian 1-tough triangulations with disjoint separating triangles