2. Mahmoud and Ehab and the bipartiteness

Competitive ProgrammingWeek 05

In this lecture we discuss the problem “Mahmoud and Ehab and the bipartiteness” from Codeforces Round #435 (Div. 2).

You can find the code described in the lecture at this link.

To learn more about the characterization of bipartite graphs in terms of not having odd cycles, you can examine this proof here.