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

Matchings and spanning trees in Boolean weighted graphs

โœ Scribed by Kenneth A Berman

Book ID
107884134
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
384 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the spanning trees of weighted graphs
On the spanning trees of weighted graphs
โœ Ernst W. Mayr; C. Greg Plaxton ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 874 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.