find length of shortest odd cycle
undirected unweighted graph
OddGirth returns the length of the shortest odd cycle in a simple graph.
G ≔ SpecialGraphsHypercubeGraph⁡3
G≔Graph 1: an undirected graph with 8 vertices and 12 edge(s)
H ≔ Subdivide⁡G,000,001
H≔Graph 2: an undirected graph with 9 vertices and 13 edge(s)
Download Help Document