Assertion: graph's number | /r/HasProperty | obtained by greedy algorithm
Facets:
value: by using a vertex
type: MANNER
Source sentences:
text: The maximum (worst) number of colors that can be obtained by the greedy algorithm, by using a vertex ordering chosen to maximize this number, is called the Grundy number of a graph.