Note on graphs colouring

Dănuţ Marcu

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.

Full Text: pdf