Le Matematiche (May 1992)
Note on graphs colouring
Abstract
In this paper, we give the maximal number of (k+r)-colouring of a graph with n vertices and chromatic number k. Also, we obtain the maximal values for chromatic polynomial of a graph.
Le Matematiche (May 1992)
In this paper, we give the maximal number of (k+r)-colouring of a graph with n vertices and chromatic number k. Also, we obtain the maximal values for chromatic polynomial of a graph.