New bounds on the Grundy number of products of graphs

Victor Campos, András Gyárfás, Frédéric Havet, Claudia Linhares Sales, Frédéric Maffray

Research output: Contribution to journalArticle

2 Citations (Scopus)


The Grundy number of a graph G is the largest k such that G has a greedy k-coloring, that is, a coloring with k colors obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this article, we give new bounds on the Grundy number of the product of two graphs.

Original languageEnglish
Pages (from-to)78-88
Number of pages11
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - Sep 1 2012



  • Grundy
  • coloring
  • product

ASJC Scopus subject areas

  • Geometry and Topology

Cite this