10-tough chordal graphs are Hamiltonian

DOI10.1016/j.jctb.2016.07.002zbMath1350.05087arXiv1508.02568OpenAlexW2962746925MaRDI QIDQ345090

Tomáš Kaiser, Adam Kabela

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.02568

zbMATH Keywords

chordal graphtoughnessHamilton cycleHamilton-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ The structure of minimally \(t\)-tough, \(2K_2\)-free graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ A closure lemma for tough graphs and Hamiltonian degree conditions ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs ⋮ Unnamed Item ⋮ The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs

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