Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

Bipartite check and having a cycle of odd number of nodes

Revision en1, by LunaticPriest, 2019-07-01 22:40:39

Is "checking if a graph can be colored by two colors" problem the same as "checking if a graph contains a cycle of an odd number of nodes"? Can we say that a graph is bipartite if it doesn't contain an odd cycle? Are they equivalent statements?

Tags #bipartite, #cycles, #graph


  Rev. Lang. By When Δ Comment
en1 English LunaticPriest 2019-07-01 22:40:39 301 Initial revision (published)