graph coloring problem has been focuse by researchers due to NP-Hard nature. In this article, this problem is solved by simulating the behavior of insect in wheat farms, namely eurygaster. These insects attack to farms and when one farm is disrupted, they attack to other farms in a manner that all farms will be disrupted. On the other hand, graph coloring is a NP-Hard problem which by using some huristic method like eurygaster can be solved. The evaluation results show that proposed algorithm is siutble to solve graph coloring problem.
