Skip to Main content Skip to Navigation

New bounds on the Grundy number of products of graphs

Victor Campos 1 Andras Gyarfas 2 Frédéric Havet 3 Claudia Linhares Sales 1 Frédéric Maffray 4
3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
4 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Frederic Havet <>
Submitted on : Sunday, April 4, 2010 - 11:27:04 AM
Last modification on : Monday, December 14, 2020 - 3:30:28 PM
Long-term archiving on: : Friday, October 19, 2012 - 11:15:29 AM


Files produced by the author(s)


  • HAL Id : inria-00470158, version 1


Victor Campos, Andras Gyarfas, Frédéric Havet, Claudia Linhares Sales, Frédéric Maffray. New bounds on the Grundy number of products of graphs. [Research Report] RR-7243, INRIA. 2010. ⟨inria-00470158⟩



Record views


Files downloads