On the First-Fit Chromatic Number of Graphs
SIAM Journal on Discrete Mathematics
Graph Theory
Hi-index | 0.00 |
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. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:78–88, 2012 © 2012 Wiley Periodicals, Inc.