]. H. Bktvl00, T. Bodlaender, R. B. Kloks, J. Tan, and . Van-leeuwen, ?-coloring of graphs, Proc. STACS 2000 : 17th Annual Symposium on Theoretical Aspect of Computer Science, pp.395-406, 2000.

C. [. Bertossi, R. B. Pinotti, and . Tan, Efficient use of radio spectrum in wireless networks with channel separation between close stations, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '00, 2000.
DOI : 10.1145/345848.345853

C. [. Bertossi, R. B. Pinotti, and . Tan, Channel assignment with separation for special classes of wireless networks: grids and rings, Proceedings 16th International Parallel and Distributed Processing Symposium, pp.28-33, 2002.
DOI : 10.1109/IPDPS.2002.1016599

D. [. Chang and . Kuo, The $L(2,1)$-Labeling Problem on Graphs, SIAM Journal on Discrete Mathematics, vol.9, issue.2, pp.309-316, 1996.
DOI : 10.1137/S0895480193245339

. J. Ckk-+-02-]-g, W. Chang, D. Ke, D. D. Kuo, R. K. Liu et al., On L(d, 1)-labelings of graphs, Discrete Mathematics, vol.220, pp.57-66, 2002.

T. Calamoneri and R. Petreschi, -labeling of planar graphs, Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '01, pp.28-33, 2001.
DOI : 10.1145/381448.381452
URL : https://hal.archives-ouvertes.fr/hal-01388546

A. Dubhashi, S. Mvs, A. Pati, S. R. , and A. M. Shende, Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids, Proc. IWDC'02 (International Workshop on Distributed Computing), pp.130-141, 2002.
DOI : 10.1007/3-540-36385-8_14

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

T. [. Fiala, J. Kloks, and . Kratochvil, Fixed-parameter complexity of ??-labelings, Discrete Applied Mathematics, vol.113, issue.1, pp.59-72, 2001.
DOI : 10.1016/S0166-218X(00)00387-5

J. Fiala, J. Kratochvil, and A. Proskurowski, Distance Constrained Labeling of Precolored Trees, Proc. 7th Italian Conference, pp.285-292, 2001.
DOI : 10.1007/3-540-45446-2_18

R. [. Griggs and . Yeh, Labelling Graphs with a Condition at Distance 2, SIAM Journal on Discrete Mathematics, vol.5, issue.4, pp.586-595, 1992.
DOI : 10.1137/0405048

]. W. Hal80 and . Hale, Frequency assignment : theory and applications, Proc. IEEE, pp.1497-1514, 1980.

]. P. Jha00 and . Jha, Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol.47, issue.10, pp.1531-1534, 2000.
DOI : 10.1109/81.886984

. K. Jns-+-00-]-p, A. Jha, P. Narayanan, K. Sood, V. Sundaram et al., On L(2, 1)-labeling of the cartesian product of a cycle and a path, Ars Combin, vol.55, pp.81-89, 2000.

]. D. Kra and . Kral, Coloring powers of chordal graphs, SIAM J. Discr. Math

M. [. Molloy and . Salavatipour, Frequency Channel Assignment on Planar Networks, Proc. 10th Annual European Symposium, pp.736-747, 2002.
DOI : 10.1007/3-540-45749-6_64

]. D. Sak94 and . Sakai, Labeling chordal graphs with a condition at distance two, SIAM J. Discrete Math, vol.7, pp.133-140, 1994.

M. Whittlesey, J. Georges, and D. W. Mauro, On the $\lambda$-Number of $Q_n $ and Related Graphs, SIAM Journal on Discrete Mathematics, vol.8, issue.4, pp.499-506, 1995.
DOI : 10.1137/S0895480192242821