Assertion: graph's g | /r/HasAspect | coloring number
Facets:
value: at 1
type: OTHER
Source sentences:
text: A third, equivalent formulation is that G is k-degenerate (or has coloring number at most k + 1) if and only if the edges of G can be oriented to form a directed acyclic graph with outdegree at most k.