Assertion: graph's cycle | /r/HasProperty | odd
Facets:
Source sentences:
text: It is possible to test whether a graph is bipartite, and to return either a two-coloring (if it is bipartite) or an odd cycle (if it is not) in linear time, using depth-first search.
text: An induced cycle of odd length at least 5 is called an odd hole.
text: For the intersection graphs of n {\displaystyle n} line segments or other simple shapes in the Euclidean plane, it is possible to test whether the graph is bipartite and return either a two-coloring or an odd cycle in time O ( n log ⁡ n )
text: Additionally, a graph is bipartite if and only if it contains no odd cycles.