Some properties of k-trees

DOI10.1016/J.DISC.2010.05.031zbMATH Open1200.05127OpenAlexW2026972725MaRDI QIDQ708399FDOQ708399

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

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

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Finding Hamiltonian circuits in interval graphs
• 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
• 1-tough cocomparability graphs are hamiltonian
• Toughness and Hamiltonicity in \(k\)-trees

Cited In (7)

• Notions around tree property 1
• Title not available (Why is that?)
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Some results related to the tenacity and existence of \(k\)-trees
• Properties related to the function of the number of undirected non-isomorphic trees
• On several properties of a class of hybrid recursive trees
• Title not available (Why is that?)

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)