𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees

✍ Scribed by Xiaofeng Gu; Hong-Jian Lai; Yanting Liang

Book ID
116217513
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
202 KB
Volume
25
Category
Article
ISSN
0893-9659

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.

The degree-preserving spanning tree prob
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ Ξ΅ __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn