Assertion: graph | /r/HasAspect | chromatic number
Facets:
value: by brooks' theorem
type: OTHER
Source sentences:
text: By Brooks' theorem, any graph other than a clique or an odd cycle has chromatic number at most Δ, and by Vizing's theorem any graph has chromatic index at most Δ + 1.