Assertion: graph's path | /r/HasProperty | single
Facets:
value: in this case
type: TEMPORAL
Source sentences:
text: A path graph is a graph consisting of a single path.
text: Two other kinds are a pair of unbalanced circles together with a connecting simple path, such that the two circles are either disjoint (then the connecting path has one end in common with each circle and is otherwise disjoint from both) or share just a single common vertex (in this case the connecting path is that single vertex).