Toughness and Hamiltonicity of a class of planar graphs

DOI10.1016/j.disc.2003.11.046zbMath1048.05053OpenAlexW2009937948MaRDI QIDQ1883251

Yanyan Li

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.046

zbMATH Keywords

Hamiltonian cyclesChordal graphPlanar graphToughness

Mathematics Subject Classification ID

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

Related Items

Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• A 1-tough nonhamiltonian maximal planar graph
• On the shortness exponent of 1-tough, maximal planar graphs
• Not every 2-tough graph is Hamiltonian
• Toughness and nonhamiltonicity of polyhedral graphs
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• A Theorem on Planar Graphs
• Toughness and the existence ofk-factors
• More than one tough chordal planar graphs are Hamiltonian