Edge‐disjoint spanning trees: A connectedness theorem
Martin Farber, Bruce Richter, Herbert S. Shank · Journal of Graph Theory · 1985
Abstract It is well known that any spanning tree of a graph can be obtained from any other by a sequence of single edge exchanges in a way that preserves, at each step, the property of being a spanning tree. We consider a variation of this problem concerning pairs of edge‐disjoint spanning trees. In particular, it is shown that any pair of edge‐disjoint spanning trees can be obtained from any other by a sequence of single edge exchanges in a way that preserves, at each step, the property of being edge‐disjoint spanning trees.