Spanning trees with many leaves
We show that if G is a simple connected graph with |E(G)|≥|V(G)|+1/2t(t-1) and |V(G)|≠t+2, then G has a spanning tree with >t leaves, and this is best possible. © 2001 John Wiley & Sons, Inc.
Publication Source (Journal or Book title)
Journal of Graph Theory
Ding, G., Johnson, T., & Seymour, P. (2001). Spanning trees with many leaves. Journal of Graph Theory, 37 (4), 189-197. https://doi.org/10.1002/jgt.1013