Assertion: graph's edge | /r/CapableOf | represent adjacency
Facets:
value: between two subtrees
type: OTHER
Source sentences:
text: If H is represented by a collection of subtrees of G as above, then H is an odd minor of G whenever it is possible to assign two colors to the vertices of G in such a way that each edge of G within a subtree is properly colored (its endpoints have different colors) and each edge of G that represents an adjacency between two subtrees is monochromatic (both its endpoints are the same color).