10-tough chordal graphs are Hamiltonian (extended abstract)

DOI10.1016/J.ENDM.2015.06.045MaRDI QIDQ322253zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

chordal graphHamiltonian cycletoughness

Mathematics Subject Classification ID

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

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

Cites work

• Finding Hamiltonian circuits in interval graphs
• Hall's theorem for hypergraphs
• scientific article; zbMATH DE number 1124477 (Why is no real title available?)
• More than one tough chordal planar graphs are Hamiltonian
• Not every 2-tough graph is Hamiltonian
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Tough graphs and Hamiltonian circuits.
• Toughness in graphs -- a survey
• Toughness, hamiltonicity and split graphs

Cited in

(5)

• 1-tough cocomparability graphs are hamiltonian
• Toughness and Hamiltonicity of a class of planar graphs
• 10-Gabriel graphs are Hamiltonian
• 10-tough chordal graphs are Hamiltonian
• More than one tough chordal planar 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)