KnowraBrooks' theoremLinked fromLinked fromThe 5 pages that link to Brooks' theorem, each with the reason it gives.All 5Related 3Compared with 2Graph coloringRelated: It gives a sharp general bound for many graphs without finding an optimal coloring.Chromatic numberRelated: It often gives a sharp upper bound below the maximum degree plus one.Vizing's theoremRelated: It is a parallel degree-based coloring theorem for vertices rather than edges.De Bruijn–Erdős theorem (graph theory)Compared with: Brooks' theorem gives degree-based coloring bounds; this theorem explains how finite bounds govern infinite graphs.Goldberg–Seymour conjectureCompared with: It offers a contrasting degree-bound paradigm for vertex coloring rather than edge coloring.