Assertion: graph | /r/CapableOf | bound arboricity
Facets:
Source sentences:
text: For a graph family, the existence of k and l such that the graphs in the family are all (k,l)-sparse is equivalent to the graphs in the family having bounded degeneracy or having bounded arboricity.