Graph Coloring · Hard problem

$C_7$ is a complete graph

Brooks' theorem only bounds edge colorings

$C_7$ is an odd cycle, one of the two exceptions in Brooks' theorem

$\Delta(C_7)=3$, so the bound is $3$