Assertion: graph's path | /r/CapableOf | leave the two vertices of the pair
Facets:
value: via disjoint edges
type: MANNER
Source sentences:
text: Since these paths must leave the two vertices of the pair via disjoint edges, a k-vertex-connected graph must have degeneracy