Assertion: graph's edge | /r/HasProperty | partitioned in same way
Facets:
value: into k pseudoforests
type: LOCATION
Source sentences:
text: The edges of a graph with such an orientation may be partitioned in the same way into k pseudoforests, and conversely any partition of a graph's edges into k pseudoforests leads to an outdegree-k orientation (by choosing an outdegree-1 orientation for each pseudoforest), so the minimum outdegree of such an orientation is the pseudoarboricity, which again is at most equal to the degeneracy.