Assertion: graph's ordering | /r/HasSubevent | greedy coloring
Facets:
Source sentences:
text: There exists an ordering that leads to a greedy coloring with the optimal number of χ ( G ) {\displaystyle \chi (G)} colors.
text: On the other hand, greedy colorings can be arbitrarily bad; for example, the crown graph on n vertices can be 2-colored, but has an ordering that leads to a greedy coloring with n / 2 {\displaystyle n/2} colors.