Published April 2010 | Version v1
Report

New bounds on the Grundy number of products of graphs

Contributors

Others:

Description

The Grundy number of a graph 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 give new bounds on the Grundy number of the product of two graphs.

Additional details

Identifiers

URL
https://hal.inria.fr/inria-00470158
URN
urn:oai:HAL:inria-00470158v1