𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected Factors and Spanning Trees in Graphs

✍ Scribed by Taro Tokuda; Baoguang Xu; Jianfang Wang

Publisher
Springer Japan
Year
2003
Tongue
English
Weight
81 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximizing spanning trees in almost comp
Maximizing spanning trees in almost complete graphs
✍ Gilbert, Bryan; Myrvold, Wendy πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 94 KB πŸ‘ 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening out path lengths increases the number of spa

Maximizing spanning trees in almost comp
Maximizing spanning trees in almost complete graphs
✍ Gilbert, Bryan; Myrvold, Wendy πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 94 KB πŸ‘ 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening-out path lengths increases the number of spa

Graphs with homeomorphically irreducible
Graphs with homeomorphically irreducible spanning trees
✍ Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 509 KB

## Abstract It is an NP‐complete problem to decide whether a graph contains a spanning tree with no vertex of degree 2. We show that these homeomorphically irreducible spanning trees are contained in all graphs with minimum degree at least __c__√__n__ and in triangulations of the plane. They are ne