Assertion: thickness | /r/HasProperty | minimum number of forests
Facets:
Source sentences:
text: Therefore, the thickness of any graph G is at most equal to the arboricity of the same graph (the minimum number of forests into which it can be partitioned) and at least equal to the arboricity divided by three.