1. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Comput. 39(4), 345–351 (1987)
2. Lim, A., Wang, F.: Meta-heuristics for robust graph coloring problem. In: Proceedings of 16th IEEE International Conference on Tools with Artificial Intelligence, Florida, pp. 514–518 (2004)
3. Ray, B., Pal, A.J., Bhattacharyya, D., Kim, T.H.: An Efficient GA with Multipoint Guided Mutation for Graph Coloring Problems. Int. J. Signal Process. Image Process. and Pattern Recognit. 3(2), 51–58 (2010)
4. Brelaz, D.: New methods to color the vertices of a graph. Commun. ACM. 22, 251–256 (1979)
5. Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for Graph coloring. Eur. J. Oper. Res. 151(2), 379–388 (2003)