The First-Fit (or Grundy) chromatic number of G, written as CFF(G), is defined as the maximum number of classes in an ordered partition of V(G) into independent sets so that each vertex has a neighbor in each set earlier than its own. The well-known Nordhaus--Gaddum inequality states that the sum of the ordinary chromatic numbers of an n-vertex graph and its complement is at most n + 1. Zaker suggested finding the analogous inequality for the First-Fit chromatic number. We show for n ≥ 10 that [(5n + 2)/4] is an upper bound, and this is sharp. We extend the problem for multicolorings as well and prove asymptotic results for infinitely many cases. We also show that the smallest order of C4-free bipartite graphs with CFF(G)=k is asymptotically 2k2 (the upper bound answers a problem of Zaker [9]). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 7588, 2008
['Zoltán Füredi', 'András Gyárfás', 'Gábor N. Sárközy', 'Stanley M. Selkow']
Inequalities for the first-fit chromatic number