Three tree-paths

Itai and Rodeh 3] have proved that for any 2-connected graph G and any vertex s ∈ G there are two spanning trees such that the paths from any other vertex to s on the trees are disjoint. In this paper the result is generalized to 3-connected graphs.