Colouring the Square of the Cartesian Product of Trees
arXiv:1008.2250
Abstract
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.
arXiv:1008.2250
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.