J. Barajas and O. Serra, Distance graphs with maximum chromatic number, Discrete Mathematics, vol.308, issue.8, pp.1355-1365, 2008.
DOI : 10.1016/j.disc.2007.07.061
URL : https://hal.archives-ouvertes.fr/hal-01184347

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

R. B. Eggleton, P. Erd?, and D. K. Skilton, Colouring the real line, Journal of Combinatorial Theory, Series B, vol.39, issue.1, pp.86-100, 1985.
DOI : 10.1016/0095-8956(85)90039-5

R. B. Eggleton, P. Erd?, and D. K. Skilton, Colouring prime distance graphs, Graphs and Combinatorics, vol.58, issue.1, pp.17-32, 1990.
DOI : 10.1007/BF01787476

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, Third Workshop on Graph Classes, Optimization, and Width Parameters Euge ne, pp.771-778, 2007.
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, Traces from LAGOS'07 IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas -2007, pp.1224-1228, 2010.
DOI : 10.1016/j.dam.2009.06.001

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

H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs, Discrete Math. Theor. Comput. Sci, vol.10, issue.1, pp.57-70, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00972307

D. D. Liu, From rainbow to the lonely runner: a survey on coloring parameters of distance graphs, Taiwanese J. Math, vol.12, issue.4, pp.851-871, 2008.

D. D. Liu and X. Zhu, Fractional chromatic number of distance graphs generated by two-interval sets, European Journal of Combinatorics, vol.29, issue.7, pp.1733-1743, 2008.
DOI : 10.1016/j.ejc.2007.09.007

R. Soukal and P. Holub, A note on packing chromatic number of the square lattice, Electronic Journal of Combinatorics, 2010.

J. Steinhardt, On coloring the odd-distance graph, Electron. J. Combin, vol.16, issue.7, 2009.

M. Voigt and H. Walther, Chromatic number of prime distance graphs, Discrete Applied Mathematics, vol.51, issue.1-2, pp.197-209, 1991.
DOI : 10.1016/0166-218X(94)90109-0