Title of article
On the chromatic number of tree graphs
Author/Authors
V. Estivill-Castro، نويسنده , , M. Noy، نويسنده , , J. Urrutia، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
363
To page
366
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).
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950568
Link To Document