New bounds on the Grundy number of products of graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

New bounds on the Grundy number of products of graphs

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.
Fichier principal
Vignette du fichier
RR-7243.pdf (161.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00470158 , version 1 (04-04-2010)

Identifiers

  • HAL Id : inria-00470158 , version 1

Cite

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⟩
274 View
291 Download

Share

Gmail Facebook Twitter LinkedIn More