Created an highly optimized code used to solve chromatin-color-of-graph question that currently has complexity O(v^2).
For a standard sudoko its minimum color comes out to be 12.
Enter number-of-vertices number-of-edges.
Next enter number-of-edges pairs that represent such undirected edges.