S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
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
Bowen Zhou, Bing Xiang, et al.
SSST 2008
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976