Journal of Graph Theory · 2001 · 55 citations · 2 references
Natural SciencesPlant SciencesCombinatoricsGraph AlgorithmsGraph TheoryGraph Theory AnalysisGraph Theory ModelsSpanning Tree ConstructionTree Algorithms
Abstract We show that if G is a simple connected graph with and $|V(G)| \,\neq\,t+2$ , then G has a spanning tree with > t leaves, and this is best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 189–197, 2001
2
Spanning trees in graphs of minimum degree 4 or 5
Jerrold R. Griggs, Mingshen Wu · Discrete Mathematics · 1992 · 77 citations