ABSTRACT
The (vertex) graph coloring problem (GCP) is a central problem in graph theory [1] and it arises in many real-life applications like register allocation [2], air traffic flow management [3], frequency assignment [4], light wavelengths assignment in optical networks [5], or timetabling [6,7].
