Spanning trees of bounded degree
From MaRDI portal
Publication:5947942
zbMath0991.05031MaRDI QIDQ5947942
William T. jun. Trotter, Geng-Hua Fan, Henry A. Kierstead, Andrzej Czygrinow, Glenn H. Hurlbert
Publication date: 11 December 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121942
05C05: Trees
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Spanning k-ended trees of 3-regular connected graphs, The number of bounded‐degree spanning trees, Spanning \(k\)-ended trees of bipartite graphs, Spanning \(k\)-trees of bipartite graphs, Some results on spanning trees, Spanning trees: A survey, Spanning \(k\)-trees of \(n\)-connected graphs, On covering vertices of a graph by trees