𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected Domination and Spanning Trees with Many Leaves

✍ Scribed by Caro, Yair; West, Douglas B.; Yuster, Raphael

Book ID
118198144
Publisher
Society for Industrial and Applied Mathematics
Year
2000
Tongue
English
Weight
150 KB
Volume
13
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 trees with many leaves
Spanning trees with many leaves
✍ D. V. Karpov πŸ“‚ Article πŸ“… 2011 πŸ› Springer US 🌐 English βš– 211 KB
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
Spanning Trees with Few Leaves
Spanning Trees with Few Leaves
✍ Masao Tsugaki; Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› Springer Japan 🌐 English βš– 272 KB