✦ LIBER ✦

Spanning Trees Crossing Few Barriers

✍ Scribed by Tetsuo Asano; Mark de Berg; Otfried Cheong; Leonidas J. Guibas; Jack Snoeyink; Hisao Tamaki

Publisher: Springer
Year: 2003
Tongue: English
Weight: 232 KB
Volume: 30
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-003-2853-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning Trees with Few Leaves

✍ Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 272 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.