On independent spanning trees

TitleOn independent spanning trees
Publication TypeJournal Articles
Year of Publication1992
AuthorsKhuller S, Schieber B
JournalInformation Processing Letters
Volume42
Issue6
Pagination321 - 323
Date Published1992/07/24/
ISBN Number0020-0190
Keywordscombinatorial problems, edge connectivity, spanning trees, vertex connectivity
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.

URLhttp://www.sciencedirect.com/science/article/pii/002001909290230S
DOI10.1016/0020-0190(92)90230-S