Which of the following statement for the connected graph is/are CORRECT?
1
A graph is bipartite if and only if it is two colorable.
2
A cycle graph with even vertices is bipartite.
3
A graph is bipartite if and only if it does not contain an odd cycle.
4
A tree is a bipartite graph.