A survey on the distance-colouring of graphs

A distance-colouring relative to distance p   of a graph G=(V,E)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.