1. G. Agnarsson and M. M. Halldórsson: Coloring powers of planar graphs, SIAM J. Discrete Math. 16 (2003), 651–662.
2. Grad. Texts in Math.;J A Bondy,2008
3. O. V. Borodin: Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs (in Russian), Metody Diskret. Analyz. 41 (1984), 12–26.
4. O. V. Borodin, H. J. Broersma, A. Glebov and J. van den Heuvel: Minimal degrees and chromatic numbers of squares of planar graphs (in Russian), Diskretn. Anal. Issled. Oper. Ser. 1 8, no. 4 (2001), 9–33.
5. O. V. Borodin, H. J. Broersma, A. Glebov and J. van den Heuvel: A new upper bound on the cyclic chromatic number, J. Graph Theory 54 (2007), 58–72.