Assertion: graph's vertex | /r/HasProperty | shown as vertex
Facets:
value: in the homes
type: LOCATION
value: in utilities
type: LOCATION
Source sentences:
text: In a two-dimensional plane, a collection of six vertices (shown here as the vertices in the homes and utilities) that can be split into two completely separate sets of three vertices (that is, the vertices in the three homes and the vertices in the three utilities) is designated a K 3, 3 bipartite graph.