𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Scribed by Zhenhong, Liu; Baoguang, Xu


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
257 KB
Volume
28
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


[•]

is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.


📜 SIMILAR VOLUMES