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

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

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/inria-00173438

R. K. Yeh, A survey on labeling graphs with a condition at distance two. Discrete Math, pp.1217-1231, 2006.