Publication
Information Processing Letters
Paper

On independent spanning trees

View publication

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.

Date

24 Jul 1992

Publication

Information Processing Letters

Authors

Topics

Share