Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design