Assertion: graph's g | /r/HasProperty | k-degenerate
Facets:
Source sentences:
text: In the other direction, if G is k-degenerate, then an ordering with coloring number
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.