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

Existence of Graphs with Three Spanning Trees and Given Degree Sequence

โœ Scribed by Kundu, Sukhamay

Book ID
118159826
Publisher
Society for Industrial and Applied Mathematics
Year
1974
Tongue
English
Weight
277 KB
Volume
3
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On low bound of degree sequences of span
On low bound of degree sequences of spanning trees inK-edge-connected graphs
โœ Zhenhong, Liu; Baoguang, Xu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 257 KB ๐Ÿ‘ 3 views

[โ€ข] 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.