A Note on Admissible Exchanges in Spanning Trees
Fred Glover, Darwin D. Klingman · 1974
Abstract : A constructive result is given for identifying a complete 'pairing' (one-one matching) of edges from two spanning trees such that each pair gives rise to an admissible exchange relative to the first tree. The result is considerable stronger than the standard result concerning the existance of admissible exchanges in spanning trees, and finds application in establishing the validity of 'swapping' algorithms for problems in undirected graphs.