1. Agnarsson, G., Halldrsson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16, 651–662 (2003)
2. Bonamy, M., Cranston, D.W., Postle, L.: Planar graphs of girth at least five are square $$(\Delta (G)+2)$$-choosable. J. Combin. Theory Ser. B 134, 218–238 (2019)
3. Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part I: triangulations, CDAM Research Report Series 2002–04, (2002)
4. Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part II: general planar graphs and colourings, CDAM Research Report Series 2002–05, (2002)
5. Borodin, O.V., Ivanova, A.O.: 2-distance $$(\Delta (G)+2)$$-coloring of planar graphs with girth six and $$\Delta (G)\ge 18$$. Discrete Math. 309, 6496–6502 (2009)