1. The chromatic number of graph powers;Alon;Combin. Probab. Comput.,2002
2. 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).
3. On the total coloring of planar graphs;Borodin;J. Reine Angew. Math.,1989
4. 2-distance (Δ+2)-coloring of planar graphs with girth six and Δ≥18;Borodin;Discrete Math.,2009
5. A prescribed 2-distance (Δ+1)-coloring of planar graphs with a given girth;Borodin;Diskretn. Anal. Issled. Oper. Ser. 1,2007