Brooks' theorem
= Brooks' theorem
{c}
{wiki}
A connected graph of maximum degree $\Delta$ has chromatic number at most $\Delta$ unless it is a complete graph or an odd cycle.
= Brooks' theorem
{c}
{wiki}
A connected graph of maximum degree $\Delta$ has chromatic number at most $\Delta$ unless it is a complete graph or an odd cycle.