Brooks’ theorem on powers of graphs

We prove that for k≥3k≥3, the chromatic number of kk-th powers of graphs of maximum degree Δ≥3Δ≥3 can be bounded in a more refined way than with Brooks’ theorem, even in the case of online list coloring.