Technical Report CS0406

Title: Three Tree Connectivity
Authors: A. Zehavi and A. Itai
Abstract: Itai and Rodeh [IR] have proved that for any 2-vertex-connected graph G and any vertex r in G there are two spanning trees rooted at r such that the paths from any vertex to r on the trees are vertex-disjoint. In this paper the result is genralized to 3-vertex-connected graphs.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1986
To the main CS technical reports page

Computer science department, Technion