1. Precoloring extensions of Brooks’ theorem;Albertson;SIAM J. Discrete Math.,2005
2. Precoloring extension. I. Interval graphs;Biró;Discrete Math.,1992
3. Scheduling of incompatible jobs;Bodlaender;Discrete Appl. Math.,1994
4. O.V. Borodin, Criterion of chromaticity of a degree prescription, in: Abstracts of IV All-Union Conference on Theoretical Cybernetics, Novosibirsk, 1997, pp. 127–128 (in Russian).
5. O.V. Borodin, Problems of colouring and of covering the vertex set of a graph by induced subgraphs, Ph.D. Thesis, Novosibirsk State University, Novosibirsk, 1979 (in Russian).