Graph TheoryEasyBipartite Graphs and Matchings
Bipartite Graphs and Matchings · Easy problem
The vertices are joined in a cycle by the edges , and one extra edge is added. What is the length of the shortest cycle in this graph that has odd length?
The vertices are joined in a cycle by the edges , and one extra edge is added. What is the length of the shortest cycle in this graph that has odd length?