Assertion: graph's path | /r/CapableOf | form odd cycle
Facets:
Source sentences:
text: If they do not, then the path in the forest from ancestor to descendant, together with the miscolored edge, form an odd cycle, which is returned from the algorithm together with the result that the graph is not bipartite.