Spanning trees of bounded degree

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

zbMATH Keywords

spanning treeHamilton path

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Some results on spanning trees ⋮ Spanning \(k\)-ended trees of bipartite graphs ⋮ The number of bounded‐degree spanning trees ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ Spanning \(k\)-trees of bipartite graphs ⋮ On covering vertices of a graph by trees ⋮ Spanning k-ended trees of 3-regular connected graphs

This page was built for publication: Spanning trees of bounded degree