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

Comments

Popular posts from this blog

Show that number of pendant vertices in a binary tree is (n+1)/2 ,where n is the number of vertices in the tree.

Prove that every tree with 2 or more vertices is 2-chromatic.

Top 5 websites to learn coding Online