Assertion: graph's vertex | /r/CapableOf | leave remaining graph
Facets:
value: always
type: TEMPORAL
Source sentences:
text: A k-vertex-connected graph is a graph in which removing fewer than k vertices always leaves the remaining graph connected.