Need Help On bipartite Graph

Revision en1, by R2__D2, 2016-12-23 13:53:50

Given N nodes and M edges. I have to color(only 2 colors) the nodes in such a way that at least one of the connected nodes of each nodes belong to different color. What will be the maximum number of nodes of same colored ? I am not sure about the range of N,M. I was working on bipartite graph. Suddenly I noticed it but failed to manage any idea to solve it.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English R2__D2 2016-12-23 13:53:50 392 Initial revision (published)