Assertion: k degenerate graph | /r/HasAspect | chromatic number
Facets:
value: at 1
type: TEMPORAL
Source sentences:
text: A k-degenerate graph has chromatic number at most k + 1; this is proved by a simple induction on the number of vertices which is exactly like the proof of the six-color theorem for planar graphs.