PATHS BETWEEN TWO VERTICES IN A TREE GRAPH
Guizhen Liu · 1992
Let T(G)be the tree graph of a simple graph G.It is proved that if T and T′are two vertices of T(G)such that d_T(G)(T)(?)d_T(G}(T′),then there ared_T(G)(T) internally disjoint paths in T(G) joining T and T′.