- Record: found
- Abstract: not found
- Article: not found
Edge-disjoint spanning trees and depth-first search
Read this article at
ScienceOpenPublisher
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references13
- Record: found
- Abstract: not found
- Article: not found
Efficiency of a Good But Not Linear Set Union Algorithm
Robert Tarjan (1975)
- Record: found
- Abstract: not found
- Article: not found
Edge-Disjoint Spanning Trees of Finite Graphs
C. Nash-Williams (1961)
- Record: found
- Abstract: not found
- Article: not found
On the Problem of Decomposing a Graph into n Connected Factors
W. T. Tutte (1961)