Graph colouring is an interesting and computationally hard problem in graph theory. It has applications in a wide variety of areas. Although the problem is very simple to state, the underlying principles are often very hard to understand. Solving the graph colouring problem is a challenging exercise.
The only general solution to finding an optimal graph
coloring is exhaustive search. This strategy can become prohibitively expensive, as the graph size increases.
It is alo very difficult to get good material which one can read, and approach graph colouring problems.
I found a good starting point for the exploration of graph colouring. This overview of graph colouring, created by two Professors of the Danish institute IMADA (belonging to the University of Southern Denmark )
http://www.sdu.dk/Om_SDU/Institutter_centre/Imada_matematik_og_datalogi?sc_lang=en, gives an exhaustiv overview of graph colouring.
You can find the overview at ::