✦ LIBER ✦

Spanning trees with many leaves

✍ Scribed by D. V. Karpov

Publisher: Springer US
Year: 2011
Tongue: English
Weight: 211 KB
Volume: 179
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-011-0613-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ 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 Few Leaves

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

Graphs with not too many spanning trees

✍ Guoli Ding 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

On a Spanning Tree with Specified Leaves

✍ Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 88 KB

A New Algorithm for Finding Trees with M

A New Algorithm for Finding Trees with Many Leaves

✍ Joachim Kneis; Alexander Langer; Peter Rossmanith 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 561 KB

Heavy cycles and spanning trees with few

Heavy cycles and spanning trees with few leaves in weighted graphs

✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.