Graph Colouring Problem Based on Discrete Imperialist Competitive Algorithm

Hojjat Emami, Shahriar Lotfi

In graph theory, Graph Colouring Problem (GCP) is an assignment of colours to vertices of any given graph such that the colours on adjacent vertices are different. The GCP is known…