H. L. Bodlaender, T. Kloks, R. B. Tan, and J. Van-leeuwen, Approximations for ??-Colorings of Graphs, The Computer Journal, vol.47, issue.2, pp.193-204, 2004.
DOI : 10.1093/comjnl/47.2.193

T. Calamoneri, The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography, The Computer Journal, vol.49, issue.5, pp.585-608, 2006.
DOI : 10.1093/comjnl/bxl018

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

J. Fiala, P. Golovach, and J. Kratochvíl, Distance Constrained Labelings of Graphs of Bounded Treewidth, Proceedings of ICALP 2005, pp.360-372, 2005.
DOI : 10.1007/11523468_30

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

D. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou, and P. G. Spirakis, NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, 2000.
DOI : 10.1007/3-540-44612-5_32

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

F. Havet and S. Thomassé, Complexity of (p, 1)-total labelling
URL : https://hal.archives-ouvertes.fr/lirmm-00432700

A. E. Koller, The Frequency Assignment Problem, 2005.

A. E. Koller, S. D. Noble, and A. Yeo, Computing the minimum span of an L(2,1)-labelling of an outerplanar graph

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, 1978.
DOI : 10.1145/800133.804350

R. K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Mathematics, vol.306, issue.12, pp.1217-1231, 2006.
DOI : 10.1016/j.disc.2005.11.029