J. Ekstein, J. Fiala, P. Holub, and B. Lidický, The packing chromatic number of the square lattice is at least 12, 2010.

G. Fertin, E. Godard, and A. Raspaud, Acyclic and k-distance coloring of the grid, Information Processing Letters, vol.87, issue.1, pp.51-58, 2003.
DOI : 10.1016/S0020-0190(03)00232-1
URL : https://hal.archives-ouvertes.fr/hal-00307787

J. Fiala and P. A. Golovach, Complexity of the packing coloring problem for trees, Discrete Applied Mathematics, vol.158, issue.7, pp.771-778, 2010.
DOI : 10.1016/j.dam.2008.09.001

J. Fiala, S. Klav?ar, and B. Lidický, The packing chromatic number of infinite product graphs, European Journal of Combinatorics, vol.30, issue.5, pp.1101-1113, 2009.
DOI : 10.1016/j.ejc.2008.09.014

A. S. Finbow and D. F. , On the packing chromatic number of some lattices, Discrete Applied Mathematics, vol.158, issue.12, pp.1224-1228, 2010.
DOI : 10.1016/j.dam.2009.06.001

N. Gastineau, Dichotomies properties on computational complexity of <mml:math altimg="si26.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>S</mml:mi></mml:math>-packing coloring problems, Discrete Mathematics, vol.338, issue.6, pp.1029-1041, 2015.
DOI : 10.1016/j.disc.2015.01.028

W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, J. M. Harris, and D. F. , Broadcast Chromatic Numbers of Graphs, Ars Combinatoria, vol.86, pp.33-49, 2008.

W. Goddard and H. Xu, A note on <mml:math altimg="si27.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>S</mml:mi></mml:math>-packing colorings of lattices, Discrete Applied Mathematics, vol.166, pp.255-262, 2014.
DOI : 10.1016/j.dam.2013.09.016

W. Goddard and H. Xu, The S-packing chromatic number of a graph, Discussiones Mathematicae Graph Theory, vol.32, issue.4, pp.795-806, 2012.
DOI : 10.7151/dmgt.1642

P. Jacko and S. Jendrol, Distance Coloring of the Hexagonal Lattice, Discussiones Mathematicae Graph Theory, vol.25, issue.1-2, pp.151-166, 2005.
DOI : 10.7151/dmgt.1269

D. Kor?e and A. Vesel, On the packing chromatic number of square and hexagonal lattice, Ars Mathematica Contemporanea, vol.7, pp.13-22, 2014.

F. Kramer and H. Kramer, A survey on the distance-colouring of graphs, Discrete Mathematics, vol.308, issue.2-3, pp.422-426, 2008.
DOI : 10.1016/j.disc.2006.11.059

A. ?evc?ková, Distant chromatic number of the planar graphs, Manuscript, 2001.

R. Soukal and P. Holub, A Note on Packing Chromatic Number of the Square Lattice, The Electronic Journal of Combinatorics, vol.17, pp.447-468, 2010.

O. Togni, On packing colorings of distance graphs, Discrete Applied Mathematics, vol.167, pp.280-289, 2014.
DOI : 10.1016/j.dam.2013.10.026
URL : https://hal.archives-ouvertes.fr/hal-00531583