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, 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

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences, 1979.

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 M. Yu, <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-Total labelling of graphs, Discrete Mathematics, vol.308, issue.4, pp.496-513, 2008.
DOI : 10.1016/j.disc.2007.03.034

C. J. Mcdiarmid and A. Sánchez-arroyo, Total colouring regular bipartite graphs is NP-hard, Discrete Math, pp.155-162, 1994.

A. Sánchez-arroyo, Determining the total colouring number is np-hard, Discrete Mathematics, vol.78, issue.3, pp.315-319, 1989.
DOI : 10.1016/0012-365X(89)90187-8

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226
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