Assertion: graph's edge | /r/HasProperty | odd cycle
Facets:
Source sentences:
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.