Brooks' theorem

The set of Brooks sets a limit for the number of colors needed to color all the vertices of a graph so that no two adjacent nodes have the same color.

Statement

The nodes chromatic number of a connected graph that is neither complete nor an odd cycle is at most as high as the maximum degree of the graph.

Additional: If the graph is fully or odd cycle, so you need maximum degree 1 colors.