Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Paper
On independent spanning trees
Abstract
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.
Related
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975