Inequalities for the Grundy chromatic number of graphs

Discrete Applied Mathematics

Volumn 155, Issue 18, 2007, Pages 2567-2572

  Zaker, Manouchehr ^a  

^a INSTITUTE FOR ADVANCED STUDIES IN BASIC SCIENCES IASBS   (Iran)

Author keywords

First Fit coloring; Graph colorings; Grundy number

Indexed keywords

BOUNDARY ELEMENT METHOD; COLOR; NUMBER THEORY; NUMERICAL METHODS;

FIRST FIT COLORING; GRAPH COLORINGS; GRUNDY NUMBER;

GRAPH THEORY;

EID: 35348959413     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.07.002     Document Type: Article

References (11)

1. Bar-Noy A., Motwani R., and Naor J. The greedy algorithm is optimal for on-line edge coloring. Inform. Process. Lett. 44 5 (1992) 251-253
2. Z. Füredi, A. Gyárfás, G.N. Sárközy, S.M. Selkow, Inequalities for the First-Fit chromatic number, manuscript, November 2005, 13pp.
3. Gyárfás A., and Lehel J. On-line and First-Fit coloring of graphs. J. Graph Theory 12 (1988) 217-227
4. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
5. Kierstead H. The linearity of First-Fit coloring of interval graphs. SIAM J. Discrete Math. 1 4 (1988) 526-530
6. 5. SIAM J. Discrete Math. 8 4 (1995) 485-498
7. H.A. Kierstead, W.T. Trotter, On-line graph coloring, in: L.A. McGeoch, D.D. Sleator (Eds.), On-Line Algorithms: Proceedings of DIMACS Workshop, February 11-13, 1991, American Mathematical Society, Providence, RI, 1992, pp. 85-92.
8. Kouider M., and Zaker M. Bounds for the b-chromatic number of some families of graphs. Discrete Math. 306 (2006) 617-623
9. Zaker M. Grundy chromatic number of the complement of bipartite graphs. Austral. J. Combin. 31 (2005) 325-329
10. Zaker M. Results on the Grundy chromatic number of graphs. Discrete Math. 306 (2006) 3166-3173
11. Zaker M., and Problem 436. Problems from the IPM workshop on Combinatorics, 9-14 August 2003. Discrete Math. 306 (2006) 3174-3179