A survey on the distance-colouring of graphs

A distance-colouring relative to distance p of a graph G=(V,E) is a mapping of V in a set of colours in such a way that any two vertices of G of distance not greater than p have distinct colours. The purpose of this paper is to give a survey of the results related to the distance-colouring of graphs introduced in 1969.

[1]  Mohammad R. Salavatipour,et al.  Frequency Channel Assignment on Planar Networks , 2002, ESA.

[2]  C. Berge.  Graphes et hypergraphes , 1970 .

[3]  André Raspaud,et al.  Acyclic and k-distance coloring of the grid , 2003, Inf. Process. Lett..

[4]  Local structures in plane maps and distance colourings , 2001, Discret. Math..

[5]  Florica Kramer.  Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes , 1972 .

[6]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[7]  Xuding Zhu,et al.  Coloring the square of a K4-minor free graph , 2003, Discret. Math..

[8]  Mohammad R. Salavatipour,et al.  A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.

[9]  Chris Jagger.  Distant Vertex Partitions of Graphs , 1998, Comb. Probab. Comput..

[10]  Oleg V. Borodin,et al.  On the total coloring of planar graphs. , 1989 .

[11]  F. Leighton,et al.  Drawing graphs in the plane with high resolution , 1993 .

[12]  Jerzy Marian Wojciechowski.  LONG INDUCED CYCLES IN THE HYPERCUBE AND COLOURINGS OF GRAPHS , 1990 .

[13]  Jan van den Heuvel,et al.  Coloring the square of a planar graph , 2003 .

[14]  Henry P. Kramer,et al.  On the Generalized Chromatic Number , 1986 .

[15]  Mario Gionfriddo,et al.  On the parameter v2(h)<=6h for L2-coloured graphs , 1988, Discret. Math..

[16]  Stanislav Jendrol',et al.  Distance Coloring of the Hexagonal Lattice , 2005, Discuss. Math. Graph Theory.

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