M. Bonamy, D. Cranston, and L. Postle, Planar graphs of girth at least five are square (?+2)-choosable, J. Comb. Theory, Series B, vol.134, pp.218-238, 2019.

M. Bonamy, B. Lévêque, and A. Pinlou, 2-distance coloring of sparse graphs, Discrete Math, vol.38, pp.155-160, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00782852

M. Bonamy, B. Lévêque, and A. Pinlou, 2-distance coloring of sparse graphs, J. Graph Theory, vol.77, issue.3, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-00782852

M. Bonamy, B. Lévêque, and A. Pinlou, Graphs with maximum degree ? ? 17 and maximum average degree less than 3 are list 2-distance (? + 2)-colorable, In Discrete Math, vol.317, pp.19-32, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01233453

O. V. Borodin and A. O. Ivanova, List 2-facial 5-colorability of plane graphs with girth at least 12, Discrete math, vol.312, pp.306-314, 2012.

Y. Bu, X. Lv, and X. Yan, The list 2-distance coloring of a graph with ?(G) = 5, In Discrete Math., Algo. and Appl, vol.7, issue.2, 2015.

Y. Bu and C. Shang, List 2-distance coloring of planar graphs without short cycles, In Discrete Math., Algo. and Appl, vol.8, issue.1, 2016.

Y. Bu and J. Zhu, Channel Assignment with r-Dynamic Coloring. 12th International Conference, AAIM 2018, pp.36-48, 2018.

Y. Bu and J. Zhu, List r-dynamic coloring of graphs with small maximum average degree, In Discrete Appl. Math, vol.258, pp.254-263, 2019.

Y. Bu and X. Zhu, An optimal square coloring of planar graphs, J. Comb. Optim, vol.24, p.580, 2012.

J. Cheng, H. Lai, K. J. Lorenzen, R. Luo, J. C. Thompson et al., r-hued coloring of sparse graphs, Discrete Appl. Math, vol.237, pp.75-81, 2018.

D. Cranston, R. Erman, and R. Skrekovski, Choosability of the square of a planar graph with maximum degree four, In Australian J. Comb, vol.59, issue.1, pp.86-97, 2014.

D. Cranston and S. Kim, List-coloring the square of a subcubic graph, In J. Graph Theory, vol.1, pp.65-87, 2008.

W. Dong and W. Lin, On 2-distance coloring of plane graphs with girth 5, In Discrete Appl. Math, vol.217, pp.495-505, 2017.

W. Dong and B. Xu, 2-distance coloring of planar graphs with girth 5, J. Comb. Optim, vol.34, p.1302, 2017.

Z. Dvo?ák, D. Kràl, P. Nejedl?, and R. ?krekovski, Coloring squares of planar graphs with girth six, In European J. Comb, vol.29, issue.4, pp.838-849, 2008.

S. G. Hartke, S. Jahanbekam, and B. Thomas, The chromatic number of the square of subcubic planar graphs, 2018.

F. Havet, J. Van-den-heuvel, C. Mcdiarmid, and B. Reed, List colouring squares of planar graphs, 2017.
URL : https://hal.archives-ouvertes.fr/inria-00303303

A. O. Ivanova, List 2-distance (? + 1)-coloring of planar graphs with girth at least 7, J. Appl. Ind. Math, vol.5, issue.2, pp.221-230, 2011.

S. Kim, S. J. Lee, and W. Park, Dynamic coloring and list dynamic coloring of planar graphs, In Discrete Appl. Math, vol.161, pp.2207-2212, 2013.

S. Kim and B. Park, List 3-dynamic coloring of graphs with small maximum average degree, In Discrete Math, vol.341, pp.1406-1418, 2018.

S. Kim and W. Park, List dynamic coloring of sparse graphs, In Comb. Optim. and Appl, vol.6831, pp.156-162, 2011.

F. Kramer and H. Kramer, Un problème de coloration des sommets d'un graphe, Comptes Rendus Mathématique, Académie des Sciences, vol.268, pp.46-48, 1969.

H. Lai, H. Song, and J. Wu, On r-hued coloring of planar graphs with girth at least 6, In Discrete Appl. Math, vol.198, pp.251-263, 2016.

S. Loeb, T. Mahoney, B. Reiniger, and J. Wise, Dynamic coloring parameters for graphs with given genus, In Discrete Appl. Math, vol.235, pp.129-141, 2018.

B. Montgomery, , 2001.

Y. Chen, S. Fan, H. Lai, H. Song, and L. Sun, On r-hued coloring of K 4 -minor free graphs, Discrete Math, pp.47-52, 2014.

H. Lai and H. Song, Upper bound of r-hued colorings of planar graphs, In Discrete Appl. Math, vol.243, pp.262-369, 2018.

C. Thomassen, The square of a planar cubic graph is 7-colorable, J. Comb. Theory, Series B, vol.128, pp.192-218, 2018.

W. Dong and W. Lin, An improved bound on 2-distance coloring plane graphs with girth 5, J. Comb. Optim, vol.32, issue.2, pp.645-655, 2016.

G. Wegner, Graphs with given diameter and a coloring problem, 1977.