Toughness and Hamiltonicity in \(k\)-trees

DOI10.1016/j.disc.2005.11.051zbMath1117.05069OpenAlexW2138582909MaRDI QIDQ868350

Kiyoshi Yoshimoto, Hajo J. Broersma, Limning Xiong

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.051

zbMATH Keywords

complexityHamiltonian graphchordal graphtraceable graph\(t\)-tough graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Long paths and toughness of \(k\)-trees and chordal planar graphs, Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs, Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs, Recent advances on the Hamiltonian problem: survey III, Independence polynomials of \(k\)-tree related graphs, Some properties of \(k\)-trees, Toughness in graphs -- a survey, Connected even factors in \(k\)-tree, Chvátal’s t 0-Tough Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Hamiltonian circuits in interval graphs
• 1-tough cocomparability graphs are hamiltonian
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Graph Classes: A Survey
• More than one tough chordal planar graphs are Hamiltonian
• Some Theorems on Abstract Graphs