Show that every Bi-partite graph is 2 chromatic.

Let G be a Bi-partite graph.

           So, V(G)=V1 U V2
   Color every vertex in V1 by one color and every vertex in V2 by another Colour.
   Then, clearly, this coloring is proper.

Thus only two colors suffice to color G.
so, G is 2 chromatic.    [Proved]




image source :Google