Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs

DOI10.1016/0012-365X(94)00177-KzbMath0838.05043OpenAlexW2033228454MaRDI QIDQ1910531

Jochen Harant, Peter J. Owens

Publication date: 24 March 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00177-k

zbMATH Keywords

toughnessmaximal planar graphsshortness exponentnon-hamiltonian graph

Mathematics Subject Classification ID

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

Related Items (5)

On the shortness exponent of 1-tough, maximal planar graphs ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Toughness in graphs -- a survey ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs

Cites Work

• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• A 1-tough nonhamiltonian maximal planar graph
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs

This page was built for publication: Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs