Brooks' theorem
Sign in to savetheorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
Show 2 more facts
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
Sources (2)
via Wikidata · CC0