1. Balakrishnan, R.; Ranganathan, K.: A Textbook of Graph Theory, 1st edn. Springer, New York Publisher (2000)
2. Garey, M.R.; Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)
3. Timir, M.; Pal, A.J.; Debnath, B.; Tai-hoon, K.: Noise reduction in VLSI circuits using modified GA based graph coloring. Int. J. Control Autom. 3(2) (2010)
4. Hertz, A.; De Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345–351 (1987)
5. Christine, L.: Mumford: new order based crossovers for the graph coloring problem. Parallel Prob. Solv. Nature 4193, 880–889 (2006)