A sufficient condition for a graph to have a \(k\)-tree

DOI10.1007/S003730170059zbMath0991.05032OpenAlexW2002082255MaRDI QIDQ5936096

Aung Kyaw

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

zbMATH Keywords

spanning treeHamilton path

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Spanning spiders and light-splitting switches ⋮ A \(k\)-tree containing specified vertices ⋮ Degree bounded spanning trees ⋮ Neighborhood unions and extremal spanning trees ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Spanning trees: A survey ⋮ On covering vertices of a graph by trees ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs

This page was built for publication: A sufficient condition for a graph to have a \(k\)-tree