Colouring the Square of the Cartesian Product of TreesArticleAuthors: David R. Wood
1
0000-0001-8866-3041
David R. Wood
- 1 Department of Mathematics and Statistics [Melbourne]
Graphs and Algorithms
[en]
We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees. The bounds are equal if each tree has even maximum degree.
Volume: Vol. 13 no. 2
Section: Graph and Algorithms
Published on: August 18, 2011
Imported on: August 16, 2010
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]