Leo Liberti, James Ostrowski
Journal of Global Optimization
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
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990