1. Using mixed graph coloring to minimize total completion time in job shop scheduling;Al-Anzi;Applied Mathematics and Computation,2006
2. G.V. Andreev, Y.N. Sotskov, F. Werner, Branch and Bound method for mixed graph coloring and scheduling, in: Proceedings of the 16th International Conference on CAD/CAM, Robotics and Factories of the Future, CARS and FOF 1, Trinidad and Tobago 2000, pp. 1–8
3. Graphes;Berge,1983
4. A note on mixed tree coloring;Furmańczyk;Information Processing Letters,2008
5. Scheduling with precedence constraints: Mixed graph coloring in series-parallel graphs;Furmańczyk;Lecture Notes in Computer Science,2008