On the chromatic number of tree graphs

被引：4

作者：

Estivill-Castro, V

Noy, M ^{[1
]}

Urrutia, J

机构：

[1] Univ Politecn Catalunya, Dept Matemat Aplicada II, Barcelona 08028, Spain

[2] Univ Newcastle, Dept Comp Sci & Software Engn, Callaghan, NSW 2308, Australia

[3] Univ Ottawa, Dept Comp Sci, Ottawa, ON K1N 6N5, Canada

来源：

DISCRETE MATHEMATICS | 2000年 / 223卷 / 1-3期

关键词：

Compendex;

D O I：

10.1016/S0012-365X(00)00092-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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). (C) 2000 Published by Elsevier Science B.V. All rights reserved.

引用

页码：363 / 366

页数：4