✦ LIBER ✦

Spanning Directed Trees with Many Leaves

✍ Scribed by Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket

Book ID: 118197712
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 202 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/070710494

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning trees with many leaves

✍ D. V. Karpov 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 211 KB

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

Improved bounds for spanning trees with

Improved bounds for spanning trees with many leaves

✍ Paul Bonsma; Florian Zickfeld 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Connected Domination and Spanning Trees

Connected Domination and Spanning Trees with Many Leaves

✍ Caro, Yair; West, Douglas B.; Yuster, Raphael 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 150 KB

Spanning Trees with Many Leaves in Graph

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three

✍ Bonsma, Paul S. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 222 KB

Spanning Trees with Few Leaves

✍ Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 272 KB