Assertion: graph's path | /r/HasProperty | connected two terminal vertices
Facets:
value: equivalently
type: MANNER
Source sentences:
text: Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2.