Toughness and nonhamiltonicity of polyhedral graphs

DOI10.1016/0012-365X(93)90519-YzbMath0771.05057WikidataQ127957376 ScholiaQ127957376MaRDI QIDQ2366022

Jochen Harant

Publication date: 29 June 1993

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

zbMATH Keywords

toughnessshortness exponentnonhamiltonian polyhedral graph

Mathematics Subject Classification ID

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

Related Items (7)

Toughness and Hamiltonicity of a class of planar graphs ⋮ Maximum and minimum toughness of graphs of small genus ⋮ Toughness, hamiltonicity and split graphs ⋮ On the shortness exponent of 1-tough, maximal planar graphs ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A Theorem on Planar Graphs

This page was built for publication: Toughness and nonhamiltonicity of polyhedral graphs