In K-coloring of an undirected graph $G=(V,E)$ is a function. $c: V \rightarrow \{0,1, \dots , K-1 \}$ such that $c(u) \neq c(v)$ for every edge $(u,v) \in E$.
Which of the following is not correct?
- $G$ is bipartite
- $G$ is $2$-colorable
- $G$ has cycles of odd length
- $G$ has no cycles of odd length