1. V. G. Vizing, ?A bound on the chromatic number of a graph,? Diskret. Analiz., No. 3, 25?30 (1964).
2. J. Holyer, ?The NP-completeness of edge-coloring,? SIAM J. Comput.,10, 718?720 (1981).
3. V. G. Vizing, ?Critical graphs with a given chromatic class,? Diskret. Analiz., No. 5, 9?17 (1965).
4. V. G. Vizing, ?Coloring the vertices of a graph in prescribed colors,? Diskret. Analiz., No. 29, 3?10 (1976).
5. P. Erdös, A. L. Rubin, and H. Taylor, ?Choosability in graphs,? in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory, and Computing, Humboldt State University, Arcata, Calif. (1979), pp. 125?127.