Colouring the Square of the Cartesian Product of Trees
2011 ◽
Vol Vol. 13 no. 2
(Graph and Algorithms)
◽
Keyword(s):
Graphs and Algorithms International audience 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.
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050021
Keyword(s):
2014 ◽
Vol 2014
◽
pp. 1-4
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 3
(Combinatorics)
◽
Keyword(s):
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2003 ◽
Vol Vol. 6 no. 1
◽