Three tree‐paths
Avram Zehavi, Alon Itai · Journal of Graph Theory · 1989
Abstract Itai and Rodeh [3] have proved that for any 2‐connected graphGand any vertexs∈Gthere are two spanning trees such that the paths from any other vertex toson the trees are disjoint. In this paper the result is generalized to 3‐connected graphs.