More than one tough chordal planar graphs are Hamiltonian
From MaRDI portal
Publication:4719329
DOI<405::AID-JGT8>3.0.CO;2-Z 10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-ZzbMath0939.05056OpenAlexW4229739612MaRDI QIDQ4719329
Michal Tkáč, Thomas Böhme, Jochen Harant
Publication date: 15 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.0.co;2-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (17)
Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Toughness and Hamiltonicity of a class of planar graphs ⋮ An improved degree based condition for Hamiltonian cycles ⋮ 10-tough chordal graphs are Hamiltonian (extended abstract) ⋮ 10-tough chordal graphs are Hamiltonian ⋮ Toughness and Hamiltonicity in \(k\)-trees ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ Some properties of \(k\)-trees ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item ⋮ On 2-walks in chordal planar graphs ⋮ Chvátal’s t 0-Tough Conjecture
Cites Work
This page was built for publication: More than one tough chordal planar graphs are Hamiltonian
