Brooks' theorem (Q6482102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Brooks' theorem |
theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree |
Statements
Identifiers
BrooksTheorem
Brooks' Theorem
1 reference
51658606
0 references
1 reference
