Assertion: graph's vertex | /r/HasProperty | two edge-disjoint paths
Facets:
Source sentences:
text: In every undirected graph, there is an equivalence relation on the vertices according to which two vertices are related to each other whenever there are two edge-disjoint paths connecting them.