Le Matematiche (May 1992)

Note on graphs colouring

  • Dănuţ Marcu

Journal volume & issue
Vol. 47, no. 1
pp. 9 – 12

Abstract

Read online

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.