Sciweavers

Share
IWPEC
2010
Springer

On the Grundy Number of a Graph

8 years 11 months ago
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
Frédéric Havet, Leonardo Sampaio
Added 14 Feb 2011
Updated 14 Feb 2011
Type Journal
Year 2010
Where IWPEC
Authors Frédéric Havet, Leonardo Sampaio
Comments (0)
books