A sufficient condition for a graph to have a \(k\)-tree
From MaRDI portal
Publication:5936096
DOI10.1007/s003730170059zbMath0991.05032MaRDI QIDQ5936096
Publication date: 28 August 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730170059
05C05: Trees
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A \(k\)-tree containing specified vertices, Degree bounded spanning trees, Spanning trees: A survey, On covering vertices of a graph by trees, Spanning spiders and light-splitting switches, Neighborhood unions and extremal spanning trees