G. Agnarsson and M. M. Halldórsson, Coloring Powers of Planar Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.4, pp.651-662, 2003.
DOI : 10.1137/S0895480100367950

K. Appel and W. Haken, Every planar map is four colourable. I. Discharging, Illinois J. Math, vol.21, pp.429-490, 1977.
DOI : 10.1090/s0002-9904-1976-14122-5
URL : http://projecteuclid.org/download/pdf_1/euclid.bams/1183538218

K. Appel, W. Haken, and J. Koch, Every planar map is four colourable, II. Reducibility. Illinois J. Math, vol.21, pp.491-567, 1977.
DOI : 10.1090/s0002-9904-1976-14122-5
URL : http://projecteuclid.org/download/pdf_1/euclid.bams/1183538218

K. Appel and W. Haken, Every Planar Map is Four Colourable, Contemporary Mathematics, vol.98, 1989.
DOI : 10.1090/s0002-9904-1976-14122-5
URL : http://projecteuclid.org/download/pdf_1/euclid.bams/1183538218

O. V. Borodin, H. J. Broersma, A. Glebov, and J. Van, Minimal degrees and chromatic numbers of squares of planar graphs (in Russian), Diskretn. Anal. Issled. Oper. Ser. 1, vol.8, issue.4, pp.9-33, 2001.

D. W. Cranston and S. Kim, List-coloring the square of a subcubic graph, Journal of Graph Theory, vol.17, issue.1, 2006.
DOI : 10.1002/jgt.20273

J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.1 and 2, pp.125-130, 1965.
DOI : 10.6028/jres.069B.013

P. Erd?-os and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Colloq. Math, Soc. J. Bolyai, vol.10, pp.609-627, 1975.

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

T. J. Hetherington and D. R. Woodall, List-colouring the square of a <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:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-minor-free graph, Discrete Mathematics, vol.308, issue.18, pp.4037-4043, 2008.
DOI : 10.1016/j.disc.2007.07.102

T. K. Jonas, Graph coloring analogues with a condition at distance two : L(2, 1)-labelings and list ?-labelings, 1993.

J. Kahn, Asymptotics of the list-chromatic index for multigraphs, Random Structures and Algorithms, vol.101, issue.2, pp.117-156, 2000.
DOI : 10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9

J. Kahn and P. M. , On the stochastic independence properties of hard-core distributions, Combinatorica, vol.114, issue.3, pp.369-391, 1997.
DOI : 10.1007/BF01215919

A. Kohl, J. Schreyer, Z. Tuza, and M. Voigt, List version of <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:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-labelings, Theoretical Computer Science, vol.349, issue.1, pp.92-98, 2005.
DOI : 10.1016/j.tcs.2005.09.032

A. V. Kostochka, Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.7, issue.4, pp.307-316, 1984.
DOI : 10.1007/BF02579141

A. V. Kostochka and D. R. Woodall, Choosability conjectures and multicircuits, Discrete Mathematics, vol.240, issue.1-3, pp.123-143, 2001.
DOI : 10.1016/S0012-365X(00)00371-X
URL : http://doi.org/10.1016/s0012-365x(00)00371-x

S. O. Krumke, M. V. Marathe, and S. S. Ravi, Approximation algorithms for channel assignment in radio networks, Dial M for Mobility; 2nd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 1998.

C. Lee, Some recent results on convex polytopes, Contemporary Mathematics, vol.114, pp.3-19, 1990.
DOI : 10.1090/conm/114/1097862

K. Lih, W. F. Wang, and X. Zhu, Coloring the square of a K4-minor free graph, Discrete Mathematics, vol.269, issue.1-3, pp.303-309, 2003.
DOI : 10.1016/S0012-365X(03)00059-1

D. D. Liu and X. Zhu, Multilevel Distance Labelings for Paths and Cycles, SIAM Journal on Discrete Mathematics, vol.19, issue.3, pp.610-621, 2005.
DOI : 10.1137/S0895480102417768

W. Mader, Homomorphies???tze f???r Graphen, Mathematische Annalen, vol.141, issue.215, pp.154-168, 1968.
DOI : 10.1007/BF01350657

C. Mcdiarmid, On the span in channel assignment problems: bounds, computing and counting, Discrete Mathematics, vol.266, issue.1-3, pp.387-397, 2003.
DOI : 10.1016/S0012-365X(02)00821-X

M. Molloy and B. Reed, Graph colouring and the probabilistic method, Algorithms and Combinatorics, vol.23, 2002.
DOI : 10.1007/978-3-642-04016-0

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, pp.189-213, 2005.
DOI : 10.1016/j.jctb.2004.12.005

S. Norine, P. Seymour, R. Thomas, and P. Wollan, Proper minor-closed families are small, Journal of Combinatorial Theory, Series B, vol.96, issue.5, pp.754-757, 2006.
DOI : 10.1016/j.jctb.2006.01.006
URL : http://doi.org/10.1016/j.jctb.2006.01.006

Y. Rabinovitch, A. Sinclair, and A. Widgerson, Quadratic dynamical systems, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.304-313, 1992.
DOI : 10.1109/SFCS.1992.267761

M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publications math??matiques de l'IH??S, vol.19, issue.158, pp.73-205, 1995.
DOI : 10.1007/BF02699376

A. G. Thomason, An extremal function for contractions of graphs, Mathematical Proceedings of the Cambridge Philosophical Society, vol.38, issue.02, pp.261-265, 1984.
DOI : 10.1007/BF01350657

C. Thomassen, The square of a planar cubic graph is 7-colorable. Manuscript, 2007.

G. Wegner, Graphs with given diameter and a coloring problem, 1977.

S. A. Wong, Colouring graphs with respect to distance, 1996.

D. R. Woodall, List colourings of graphs, Soc. Lecture Note Ser, vol.288, 2001.
DOI : 10.1017/CBO9780511721328.012

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