Brooks' theorem on powers of graphs

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

No reviews yet.

No comments yet.