arXiv Analytics

Sign in

arXiv:1008.2250 [math.CO]AbstractReferencesReviewsResources

Colouring the Square of the Cartesian Product of Trees

David R. Wood

Published 2010-08-13Version 1

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.

Journal: Discrete Maths. & Theoretical Computer Science 13.2:109-112, 2011
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1504.05012 [math.CO] (Published 2015-04-20)
Polynomials vanishing on Cartesian products: The Elekes-Szabó Theorem revisited
arXiv:1402.7105 [math.CO] (Published 2014-02-27)
Fool's Solitaire on Joins and Cartesian Products of Graphs
arXiv:1411.6887 [math.CO] (Published 2014-11-25)
The Cartesian product of graphs with loops

Links

Toolbox