On the characterization of graphs with tree 3-spanners

Lan Lin, Yixun Lin

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ betwe…