Grundy number and products of graphs

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 ordering of the vertices of G. In this paper, we study the Grundy number of the lexicographic and the cartesian products of two graphs in terms of the Grundy numbers of these graphs. Regarding the lexicographic product, we show that (G)

• Type: Journal
• Year: 2010
• Where: DM
• Authors: Marie Asté, Frédéric Havet, Cláudia Linhares Sales
• Keywords: DM 2010, Greedy, Greedy Algorithm, Grundy Numbers