𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-Disjoint Spanning Trees of Finite Graphs

✍ Scribed by Nash-Williams, C. St.J. A.

Book ID
118193018
Publisher
Oxford University Press
Year
1961
Tongue
English
Weight
399 KB
Volume
s1-36
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Embedding k(nβˆ’k) edge-disjoint spanning
Embedding k(nβˆ’k) edge-disjoint spanning trees in arrangement graphs
✍ Chin-Tsai Lin πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 278 KB

The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are n

A Property on Edge-disjoint Spanning Tre
A Property on Edge-disjoint Spanning Trees
✍ Hong-Jian Lai; Hongyuan Lai; Charles Payan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 214 KB

Let G be a simple graph with n vertices and let G c denote the complement of G . Let ( G ) denote the number of components of G and G ( E ) the spanning subgraph of G with edge set E . where the minimum is taken over all such partitions . In [ Europ . J . Combin . 7 (1986) , 263 -270] , Payan conj