Some properties of k-trees

DOI10.1016/J.DISC.2010.05.031MaRDI QIDQ708399zbMATH OpenOpenAlexFDO

Authors 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

chordal graph\(k\)-treebranch numberHamilton path and cyclepath system

Mathematics Subject Classification ID

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

Recommendations

• On a connection between the existence of k-trees and the toughness of a graph
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• scientific article; zbMATH DE number 1161291
• Toughness and Hamiltonicity in k-trees
• scientific article; zbMATH DE number 4103086

Cites work

• scientific article; zbMATH DE number 1124477 (Why is no real title available?)
• 1-tough cocomparability graphs are hamiltonian
• Finding Hamiltonian circuits in interval graphs
• Graph theory
• More than one tough chordal planar graphs are Hamiltonian
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Toughness and Hamiltonicity in \(k\)-trees
• Toughness, hamiltonicity and split graphs

Cited in

(7)

• On several properties of a class of hybrid recursive trees
• Some results related to the tenacity and existence of \(k\)-trees
• Notions around tree property 1
• scientific article; zbMATH DE number 3841909 (Why is no real title available?)
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• scientific article; zbMATH DE number 5551578 (Why is no real title available?)
• Properties related to the function of the number of undirected non-isomorphic trees

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

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