Some properties of \(k\)-trees

DOI10.1016/j.disc.2010.05.031zbMath1200.05127OpenAlexW2026972725MaRDI QIDQ708399

James M. Shook, Bing Wei

Publication date: 11 October 2010

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

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

zbMATH Keywords

\(k\)-treechordal graphbranch numberHamilton path and cyclepath system

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Long paths and toughness of \(k\)-trees and chordal planar graphs

Cites Work

• Toughness and Hamiltonicity in \(k\)-trees
• Finding Hamiltonian circuits in interval graphs
• 1-tough cocomparability graphs are hamiltonian
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• More than one tough chordal planar graphs are Hamiltonian
• Unnamed Item
• Unnamed Item

This page was built for publication: Some properties of \(k\)-trees