1. O.V. Borodin, Criterion of chromaticity of a degree prescription, in: Abstracts of IV All-Union Conf. on Theoretical Cybernetics (Novosibirsk), 1977, pp. 127–128 (in Russian)
2. D.W. Cranston, S.-J. Kim, List-coloring the square of a subcubic graph, manuscript, 2006
3. Z. Dvořák, R. Škrekovski, M. Tancer, List-colouring squares of sparse subcubic graphs, IMFM Preprint PS-985, 2005
4. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), in: Congress. Numer., XXVI, Winnipeg, Man., Utilitas Math., 1980, pp. 125–157
5. A solution to a colouring problem of P. Erdös;Fleischner;Discrete Math.,1992