10-tough chordal graphs are Hamiltonian (extended abstract)

DOI10.1016/j.endm.2015.06.045zbMath1346.05152OpenAlexW2221338866MaRDI QIDQ322253

Tomáš Kaiser, Adam Kabela

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.045

zbMATH Keywords

Hamiltonian cyclechordal graphtoughness

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Finding Hamiltonian circuits in interval graphs
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Hall's theorem for hypergraphs
• More than one tough chordal planar graphs are Hamiltonian

This page was built for publication: 10-tough chordal graphs are Hamiltonian (extended abstract)