An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs

DOI10.1016/j.disc.2017.10.034zbMath1378.05032arXiv1705.09475OpenAlexW2963364355MaRDI QIDQ1690216

Adam Kabela

Publication date: 19 January 2018

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

Full work available at URL: https://arxiv.org/abs/1705.09475

zbMATH Keywords

toughnessmaximal planar graphsshortness exponent

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (1)

Long paths and toughness of \(k\)-trees and chordal planar graphs

Cites Work

• Unnamed Item
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• Shortness parameters for polyhedral graphs
• Long cycles in 3-connected graphs
• Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
• On the shortness exponent of 1-tough, maximal planar graphs
• Not every 2-tough graph is Hamiltonian
• Toughness and nonhamiltonicity of polyhedral graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• Simple paths on polyhedra
• A Theorem on Planar Graphs
• More than one tough chordal planar graphs are Hamiltonian

This page was built for publication: An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs