The K-coloring of an undirected graph G = (V, E) is a function C: V ➝ {0, 1, ......, K-1} such that c(u) ≠ c(v) for every edge (u, v) ∈ E Which of the following is not correct?
1
G has no cycles of odd length
2
G has cycle of odd length
3
G is 2-colorable
4
G is bipartite