An upper bound on the shortness exponent of 1-tough, maximal planar graphs

DOI10.1016/0012-365X(91)90099-NzbMath0729.05029MaRDI QIDQ805630

Michael B. Dillencourt

Publication date: 1991

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

zbMATH Keywords

maximal planar graph1-tough

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Toughness and nonhamiltonicity of polyhedral graphs ⋮ Toughness and Hamiltonicity of a class of planar graphs ⋮ Maximum and minimum toughness of graphs of small genus ⋮ Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs ⋮ The complexity of recognizing tough cubic graphs ⋮ On the shortness exponent of 1-tough, maximal planar graphs ⋮ Toughness and spanning trees in K4‐minor‐free 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 ⋮ Toughness and Delaunay triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Toughness and Delaunay triangulations
• Recognizing tough graphs is NP-hard
• An upper bound on the shortness exponent of inscribable polytopes
• A 1-tough nonhamiltonian maximal planar graph
• Some problems on polyhedra
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• Simple paths on polyhedra