Brooks' theorem

theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree