1. Plesnevič G. S. and Vizing V. G., “On the problem of the minimal coloring of the vertices of a graph,” Sib. Mat. Zh., vol. 6, no. 1, 234–236 (1965).
2. Vizing V. G., “Colouring the vertices of a graph with prescribed colours,” Metody Diskretnogo Analiza v Teorii Kodov i Skhem, vol. 29, 3–10 (1976).
3. Erdős P., Rubin A. L., and Taylor H., “Choosability in graphs,” in: Proc. West Coast Conf. Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, CA, 1979) / Congr. Numer., 1980, vol. 26, 125–157.
4. Alon N., “Degrees and choice numbers,” Random Struct. Algorithms, vol. 16, 364–368 (2000).
5. Borodin O. V., “Criterion of chromaticity of a degree prescription,” in: Abstracts of IV All-Union Conf. on Theoretical Cybernetics [Russian], Novosibirsk, 1977, 127–128.