finds the length of the shortest odd cycle
undirected unweighted graph
OddGirth returns the length of the shortest odd cycle in a simple graph.
G≔Graph 1: an undirected unweighted graph with 8 vertices and 12 edge(s)
H≔Graph 2: an undirected unweighted graph with 9 vertices and 13 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)