Assertion: graph's vertex | /r/HasProperty | isolated
Facets:
Source sentences:
text: An undirected graph H is a minor of another undirected graph G if a graph isomorphic to H can be obtained from G by contracting some edges, deleting some edges, and deleting some isolated vertices.
text: A vertex with degree 0 is called an isolated vertex.