\(k\)-connectivity and decomposition of graphs into forests (Q1343147)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 716328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-connectivity and decomposition of graphs into forests |
scientific article; zbMATH DE number 716328 |
Statements
\(k\)-connectivity and decomposition of graphs into forests (English)
0 references
1 February 1995
0 references
The authors show that for every \(k\)-(edge) connected graph there exists a sequence of spanning trees \((T_ 1,\dots, T_ k)\), such that \(T_ 1\cup T_ 2\cup\cdots \cup T_ j\) is \(j\)-(edge) connected for every \(1\leq j\leq k\).
0 references
\(k\)-connectivity
0 references
decomposition
0 references
forests
0 references
spanning trees
0 references
0 references
0.8169947266578674
0 references
0.8130749464035034
0 references
0.8010789155960083
0 references
0.7941856980323792
0 references
