New bounds on the Grundy number of products of graphs
Résumé
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.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...