On the chromatic number of tree graphs
No Thumbnail Available
File version
Author(s)
Estivill-Castro, V
Noy, M
Urrutia, J
Noy, M
Urrutia, J
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Peter L. Hammer
Date
2000
Size
File type(s)
Location
License
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
Conference Title
Book Title
Edition
Volume
223
Issue
1-Mar
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Pure mathematics
Applied mathematics
Theory of computation