Given a graph G where each vertex has a forbidden coloring (R,G,or B).
Constraint 3-Coloring problem asks if G is 3-colorable (such that the
forbidden constraint color is met). P or NP-Complete ? Prove it.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
