Spanning trees with many leaves

Authors
Ding, GL Johnson, T Seymour, P
Citation
Gl. Ding et al., Spanning trees with many leaves, J GRAPH TH, 37(4), 2001, pp. 189-197
Citations number
4
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
37
Issue
4
Year of publication
2001
Pages
189 - 197
Database
ISI
SICI code
0364-9024(200108)37:4<189:STWML>2.0.ZU;2-0
Abstract
We show that if G is a simple connected graph with \E(G)\V(G)\ + 1/2 t(t-1) and \V(G)\ not equal t + 2, then G has a spanning tree with >t leaves, and this is best possible. (C) 2001 John Wiley & Sons, Inc.