1. Jensen, T. R., & Toft, B. (2011). Graph coloring problems. Wiley.
2. Erciyes, K. (2013). Distributed graph algorithms for computer networks. Computer communications and networks (1st ed.). Springer.
3. Garey, M. R., & Johnson, D. S. (1979). Computersand intractability: A guide to the theory of NP-completeness. W. H. Freeman.
4. Reynolds, R. G. (1994). An introduction to cultural algorithms. In A. V. Sebald & L. J. Fogel (Eds.), Evolutionary programming—Proceedings of the Third Annual Conference (pp. 131–139). World Scientific Press.
5. Basmassi, M. A., Benameur, L., & Chentoufi, J. A. (2019). A hybrid cultural-hierarchical clustering algorithm for the graph coloring problem. Journal of Advanced Research in Dynamical and Control Systems, 11(6-SI), 1834–1842.