More than one tough chordal planar graphs are Hamiltonian

DOI10.1002/(SICI)1097-0118(199912)32:4%3C405::AID-JGT8%3E3.0.CO;2-ZzbMATH Open0939.05056OpenAlexW4229739612MaRDI QIDQ4719329FDOQ4719329

Authors T. Böhme, Michal Tkáč, Jochen Harant

Publication date 15 February 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199912)32:4%3C405::aid-jgt8%3E3.0.co;2-z

zbMATH Keywords

toughnesshamiltonian cycleschordal planar graphs

Mathematics Subject Classification ID

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

Recommendations

• Toughness and Hamiltonicity of a class of planar graphs
• 10-tough chordal graphs are Hamiltonian
• 10-tough chordal graphs are Hamiltonian (extended abstract)
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Not every 2-tough graph is Hamiltonian

Cited in

(19)

• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• On the toughness index of planar graphs
• An improved degree based condition for Hamiltonian cycles
• Recent advances on the Hamiltonian problem: survey III
• Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• 10-tough chordal graphs are Hamiltonian
• On 2-walks in chordal planar graphs
• Toughness and Hamiltonicity of strictly chordal graphs
• Toughness in graphs -- a survey
• Toughness and Hamiltonicity of a class of planar graphs
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Some properties of \(k\)-trees
• Chordality and 2-factors in tough graphs
• Chvátal's \(t_{0}\)-tough conjecture
• 10-tough chordal graphs are Hamiltonian (extended abstract)
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
• Toughness and Hamiltonicity in \(k\)-trees

This page was built for publication: More than one tough chordal planar graphs are Hamiltonian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719329)