1. Solving a preemptive scheduling problem using coloring technique;Bianco,1998
2. Scheduling Computer and Manufacturing Processes;Blazewicz,1996
3. New methods to color the vertices of a graph;Brelaz;Comm. ACM,1979
4. Chromatic scheduling and the chromatic number problem;Brown;Manag. Sci.,1972
5. M. Caramia, P. Dell’Olmo, A fast and simple local search for graph coloring, in: Proceedings of the Third Workshop on Algorithm Engineering (WAE’99), Lecture Notes in Computer Science, vol. 1668, Springer, Berlin, 1999, pp. 319–333.