On the shortness exponent of 1-tough, maximal planar graphs

DOI10.1016/0012-365X(94)00356-NzbMath0852.05055MaRDI QIDQ1918570

Michal Tkáč

Publication date: 25 November 1996

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

zbMATH Keywords

planar graphsshortness exponent

Mathematics Subject Classification ID

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

Related Items (5)

Toughness and Hamiltonicity of a class of planar graphs ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item ⋮ Non-Hamiltonian 1-tough triangulations with disjoint separating triangles

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• A 1-tough nonhamiltonian maximal planar graph
• Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
• Toughness and nonhamiltonicity of polyhedral graphs
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• Hamiltonian circuits on 3-polytopes

This page was built for publication: On the shortness exponent of 1-tough, maximal planar graphs