On the Grundy Number of a Graph

The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm according to some

• Type: Journal
• Year: 2010
• Where: IWPEC
• Authors: Frédéric Havet, Leonardo Sampaio
• Keywords: Applied Computing, Colours, Greedy Algorithm, Grundy Number, IWPEC 2010