10-tough chordal graphs are Hamiltonian (extended abstract)

DOI10.1016/J.ENDM.2015.06.045zbMATH Open1346.05152OpenAlexW2221338866MaRDI QIDQ322253FDOQ322253

Authors: Adam Kabela, Tomáš Kaiser 

Publication date: 14 October 2016

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

Recommendations

• 10-tough chordal graphs are Hamiltonian
• More than one tough chordal planar graphs are Hamiltonian
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness and Hamiltonicity of a class of planar graphs
• Not every 2-tough graph is Hamiltonian

zbMATH Keywords

Hamiltonian cycletoughnesschordal graph

Mathematics Subject Classification ID

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

Cites Work

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Title not available (Why is that?)
• 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.
• Hall's theorem for hypergraphs
• More than one tough chordal planar graphs are Hamiltonian

Cited In (2)

• Toughness and Hamiltonicity of a class of planar graphs
• 10-Gabriel graphs are Hamiltonian

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

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