Assertion: graph's edge | /r/HasProperty | partitioned in multiple different ways
Facets:
value: into two spanning trees
type: TRANSITIVE-OBJECT
value: together
type: MANNER
Source sentences:
text: Thus, the edges of any planar graph and its dual can together be partitioned (in multiple different ways) into two spanning trees, one in the primal and one in the dual, that together extend to all the vertices and faces of the graph but never cross each other.