Brooks' theorem

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.