| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650895 | Discrete Mathematics | 2008 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Florica Kramer, Horst Kramer,