Back to Search
Start Over
FOUR EDGE-INDEPENDENT SPANNING TREES.
- Source :
-
SIAM Journal on Discrete Mathematics . 2018, Vol. 32 Issue 1, p233-248. 16p. - Publication Year :
- 2018
-
Abstract
- We prove an ear-decomposition theorem for 4-edge-connected graphs and use it to prove that for every 4-edge-connected graph G and every r \in V (G), there is a set of four spanning trees of G with the following property. For every vertex in G, the unique paths back to r in each tree are edge-disjoint. Our proof implies a polynomial-time algorithm for constructing the trees. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 32
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 129494821
- Full Text :
- https://doi.org/10.1137/17M1134056