𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved bounds for spanning trees with many leaves

✍ Scribed by Paul Bonsma; Florian Zickfeld

Book ID
113567539
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
530 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spanning trees with many leaves
Spanning trees with many leaves
✍ D. V. Karpov πŸ“‚ Article πŸ“… 2011 πŸ› Springer US 🌐 English βš– 211 KB
Spanning trees with many leaves
Spanning trees with many leaves
✍ Guoli Ding; Thor Johnson; Paul Seymour πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 95 KB

## 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

Spanning Directed Trees with Many Leaves
Spanning Directed Trees with Many Leaves
✍ Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Sake πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 202 KB