I am trying to find the proof for the following problem from CLR. Prove that a undirected graph with no self edges can be divided into two groups such that for every node,atleast half of the nodes it is adjacent to, are in a different group than the node itself.
Solutions/hints will be appreciated. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
