Author/Authors :
V. Estivill-Castro، نويسنده , , M. Noy، نويسنده , , J. Urrutia، نويسنده ,
Abstract :
The tree graph T(G) of a connected graph G has as vertices the spanning trees of G, and two trees are adjacent if one is obtained from the other by interchanging one edge. In this paper we study the chromatic number of T(G) and of a related graph T∗(G).
