J. Balogh, A. Kostochka, and X. Liu, Packing chromatic number of subcubic graphs, 2017.

J. A. Bondy and U. S. , Murty: Graph Theory, 2008.

B. Bre?ar, S. Klav?ar, and D. F. , On the packing chromatic number of Cartesian products, hexagonal lattice, and trees, Discrete Applied Mathematics, vol.155, issue.17, pp.2303-2311, 2007.
DOI : 10.1016/j.dam.2007.06.008

B. Bre?ar, S. Klav?ar, and D. F. , Rall: Packing Chromatic Number of Base-3 Sierpiski Graphs, Graphs and Combin, vol.32, issue.4, pp.1315-1327, 2016.

B. Bre?ar, S. Klav?ar, D. F. Rall, and K. Wash, Packing chromatic number under local changes in a graph, Discrete Mathematics, vol.340, issue.5, pp.1110-1115, 2017.
DOI : 10.1016/j.disc.2016.09.030

B. Bre?ar, S. Klav?ar, D. F. Rall, and K. Wash, )- colorings, and characterizing the Petersen graph, Aequat. Math, vol.1, issue.91, pp.169-184, 2017.

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

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 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´ylidick´y, 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 and O. Togni, <mml:math altimg="si24.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 cubic graphs, Discrete Mathematics, vol.339, issue.10, pp.2461-2470, 2016.
DOI : 10.1016/j.disc.2016.04.017

W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, J. M. Harris, and D. F. , Rall: Broadcast chromatic numbers of graphs. Ars Comb, pp.33-49, 2008.

J. Ekstein, P. Holub, and O. Togni, The packing colouring of distance graph D(k, t). D iscrete Appl, Math, vol.167, pp.100-106, 2014.

Y. Jacobs, E. Jonck, and E. Joubert, A lower bound for the packing chromatic number of the Cartesin product of cycles. C entr, Eur. J. Math, vol.11, issue.7, pp.1344-1357, 2013.

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.

B. Martin, F. Raimondi, T. Chen, and J. Martin, The packing chromatic number of the infinite square lattice is between 13 and 15, Discrete Applied Mathematics, vol.225, pp.136-142, 2017.
DOI : 10.1016/j.dam.2017.03.013

C. Sloper, Broadcast-coloring of trees, Reports in Informatics, vol.233, pp.1-11, 2002.

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

. 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