Assertion: graph's g | /r/DefinedAs | lick
Facets:
value: as the least k such
type: OTHER
Source sentences:
text: The degeneracy of a graph G was defined by Lick & White (1970) as the least k such that every induced subgraph of G contains a vertex with k or fewer neighbors.