journal of kerbala university

Many optimization problems such as certain events cannot occur at the same time ,or certain members of a set of objects cannot be adjacent . In map coloring problem, in which colors must be chosen for countries on a map in a way that makes bordering countries with different colors.
The aim of this paper is to design and implement attractive tools for coloring IRAQ's political map with minimum number of colors called (chromatic number ) that reduce the cost of coloring using graph vertex coloring algorithm. The IRAQ's political map was drawn manual by designing software , then , represented by equivalence graph data structure , where the nodes denoted to the cities in the map and the edges denoted to the political boundaries between these cities . Also these tools can be implemented to coloring any graph data structure which represent any country's map and finding the chromatic number of it with minimum cost .