R. Battiti, A. A. Bertossi, and M. A. Bonuccelli, Assigning Codes in Wireless Networks: Bounds and Scaling Properties, Wireless Networks, vol.5, issue.3, pp.195-209, 1999.
DOI : 10.1023/A:1019146910724

A. A. Bertossi and M. A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Transactions on Networking, vol.3, issue.4, pp.441-449, 1995.
DOI : 10.1109/90.413218

A. A. Bertossi, C. M. Pinotti, and R. B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Transactions on Parallel and Distributed Systems, vol.14, issue.3, pp.222-235, 2003.
DOI : 10.1109/TPDS.2003.1189581

H. L. Bodlaender, T. Kloks, R. B. Tan, and J. Van-leeuwen, ??-Coloring of Graphs, Proc. of STACS 2000, pp.395-406, 2000.
DOI : 10.1007/3-540-46541-3_33

T. Calamoneri, Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks and Other Regular Grids, Proc. 8th Italian Conference on Theoretical Computer Science (ICTCS'03), pp.163-173, 2003.

T. Calamoneri, The L(h, k)-Labelling Problem: A Survey, 2004.

T. Calamoneri and R. Petreschi, L(h,1)-labeling subclasses of planar graphs, Journal of Parallel and Distributed Computing, vol.64, issue.3, pp.414-426, 2004.
DOI : 10.1016/j.jpdc.2003.11.005

G. J. Chang, W. Ke, D. Kuo, D. D. Liu, and R. K. Yeh, On L(d,1)-labelings of graphs, Discrete Mathematics, vol.220, issue.1-3, pp.57-66, 2002.
DOI : 10.1016/S0012-365X(99)00400-8

G. J. Chang and D. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2004

G. Fertin and A. Raspaud, L(p, q) Labeling of d-Dimensional Grids, Discrete Applied Mathematics
URL : https://hal.archives-ouvertes.fr/hal-00293512

J. R. Griggs and R. K. 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. K. Hale, Frequency assignment: Theory and applications, Proc. IEEE, pp.1497-1514, 1980.
DOI : 10.1109/PROC.1980.11899

P. K. Jha, A. Narayanan, P. Sood, K. Sundaram, and V. Sunder, On L(2, 1)-labeling of the Cartesian product of a cycle and a path, Ars Combin, vol.55, pp.81-89, 2000.

P. K. 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

T. Makansi, Transmitter-Oriented Code Assignment for Multihop Packet Radio, IEEE Transactions on Communications, vol.35, issue.12, pp.1379-1382, 1987.
DOI : 10.1109/TCOM.1987.1096728

B. H. Metzger, Spectrum Management Technique, Proc. 38th National ORSA Meeting, pp.395-406, 1970.

M. Molloy and M. R. Salavatipour, Frequency Channel Assignment on Planar Networks, Proceedings of 10th Annual European Symposium on Algorithms (ESA), pp.736-747, 2002.
DOI : 10.1007/3-540-45749-6_64

D. Sakai, Labeling Chordal Graphs: Distance Two Condition, SIAM Journal on Discrete Mathematics, vol.7, issue.1, pp.133-140, 1994.
DOI : 10.1137/S0895480191223178

M. A. Whittlesey, J. P. 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