Learn More

- Florica Kramer, Horst Kramer
- Discrete Mathematics
- 2008

In 1969 we defined in [8] and [9] the chromatic number γ(p,G) relative to distance p of a graph G to be the minimum number of colours sufficing for colouring the vertices of G in such a way that any two vertices of G of distance not greater than p have distinct colours. We gave also a characterization of the graphs for which we have γ(p,G) = p + 1. The same… (More)

- ‹
- 1
- ›