1. 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, vol. 1, 2000, Trinidad and Tobago, 2000, pp.1–8
2. Graphes;Berge,1983
3. Hard coloring problems in low degree planar bipartite graphs;Chlebik;Discrete Applied Mathematics,2006
4. Mixed Graph Coloring: Bipartite Graphs, Trees, and Series-Parallel Graphs;Furmańcyk,2006
5. Computers and Intractability, a Guide to the Theory of NP-Completeness;Garey,1979