Assertion: graph's path | /r/CapableOf | connect their endpoints
Facets:
value: to their lowest common ancestor
type: TRANSITIVE-OBJECT
Source sentences:
text: The transitive reduction consists of the edges that form length-one paths that are the only paths connecting their endpoints.
text: If, when a vertex is colored, there exists an edge connecting it to a previously-colored vertex with the same color, then this edge together with the paths in the breadth-first search forest connecting its two endpoints to their lowest common ancestor forms an odd cycle.