G. Agnarsson, R. Greenlaw, M. M. Halld´orssonhalld´, and . Halld´orsson, Powers of chordal graphs and their coloring

O. Borodin, H. J. Broersma, A. Glebov, J. Van, and . Heuvel, Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM Reserach Report, 2002.

G. J. Chang, W. Ke, D. D. Liu, and R. K. Yeh, On L(d, 1)-labellings of graphs, Discrete Math, vol.3, issue.1, pp.57-66, 2000.

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, J. Kratochv´ilkratochv´il, and T. Kloks, 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. A. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou, and P. G. Spirakis, NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, Proc. MFCS'00, pp.363-372, 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

J. Van-den-heuvel and S. Mcguiness, Coloring the square of a planar graph, Journal of Graph Theory, vol.7, issue.2, pp.110-124, 2003.
DOI : 10.1002/jgt.10077

J. Kang, 1)-labelling of 3-regular Hamiltonian graphs, 2004.

D. Kr´alkr´ and . Kr´al, An exact algorithm for channel assignment problem, Discrete Appl. Math, vol.145, issue.2, pp.326-331, 2004.

D. Kr´alkr´-kr´al-' and R. ?. Skrekovski, A theorem about channel assignment problem, SIAM J. Discrete Math, vol.16, issue.3, pp.426-437, 2003.

D. Kr´alkr´-kr´al-', Coloring powers of chordal graphs, SIAM J. Discrete Math, vol.18, issue.3, pp.451-461, 2004.

C. Mcdiarmid, On the span in channel assignment problems: bounds, computing and counting, Discrete Math, pp.387-397, 2003.

M. Molloy and M. R. Salavatipour, A bound on the chromatic number of the square of a planar graph, Journal of Combinatorial Theory, Series B, vol.94, issue.2
DOI : 10.1016/j.jctb.2004.12.005

M. Molloy and M. R. Salavatipour, Frequency Channel Assignment on Planar Networks, Proc. ESA'02, 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