Article contents
Distant Vertex Partitions of Graphs
Published online by Cambridge University Press: 01 December 1998
Abstract
We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for the cases k=2 and k=3.
- Type
- Research Article
- Information
- Copyright
- 1998 Cambridge University Press
- 3
- Cited by