Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
We prove that if any k-vertex connected graph has k vertex independent spanning trees, then any k-edge connected graph has k edge independent spanning trees. Thus, answering a question raised by Zehavi and Itai [J. Graph Theory 13 (1989)] in the affirmative. © 1992.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
David A. Selby
IBM J. Res. Dev
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB