Brooks' theorem is a result in graph theory that provides a characterization of when a connected graph can be colored with a limited number of colors, specifically in relation to its maximum degree.
Articles by others on the same topic
A connected graph of maximum degree has chromatic number at most unless it is a complete graph or an odd cycle.