We prove that for k 3, the bound given by Brooks’ theorem on the chromatic number of k-th powers of graphs of maximum degree 3 can be lowered by 1, even in the case of online list coloring.
['Marthe Bonamy', 'Nicolas Bousquet']
Brooks' theorem on powers of graphs