Brooks' theorem on powers of graphs

Abstract

We prove that for $k\ge 3$, the bound given by Brooks' theorem on the chromatic number of $k$-th powers of graphs of maximum degree $\Delta \ge 3$ can be lowered by 1, even in the case of online list coloring.

7 pages, no figure, submitted

References in corpus (1)

• The Distance Coloring of Graphs