๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spanning trees with at most leaves in -free graphs

โœ Scribed by Aung Kyaw

Book ID
113567361
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
287 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.