Skip to Main content Skip to Navigation
Journal articles

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 [?-2015] - Optimisation Combinatoire [?-2015]
G-SCOP [2006-2015] - Laboratoire des sciences pour la conception, l'optimisation et la production [2006-2015]
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 :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00749190
Contributor : Frederic Havet <>
Submitted on : Sunday, October 23, 2016 - 4:13:19 PM
Last modification on : Monday, October 12, 2020 - 10:30:27 AM

File

new-bounds-2010-04-07.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00749190, version 1

Citation

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. Journal of Graph Theory, Wiley, 2012, 71 (1), pp.78--88. ⟨hal-00749190⟩

Share

Metrics

Record views

454

Files downloads

212