Assertion: graph's vertex | /r/AtLocation | distance
Facets:
value: from each other
type: LOCATION
Source sentences:
text: A graph H is a bipartite minor of another graph G whenever H can be obtained from G by deleting vertices, deleting edges, and collapsing pairs of vertices that are at distance two from each other along a peripheral cycle of the graph.