Results on the Grundy chromatic number of graphs

Discrete Mathematics

Volumn 306, Issue 23 SPEC. ISS., 2006, Pages 3166-3173

  Zaker, Manouchehr ^a  

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

Author keywords

Chromatic number; Colorings; Edge dominating sets; First fit colorings; Grundy number; NP complete

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPHS; CHROMATIC NUMBER; EDGE DOMINATING SETS; GRUNDY NUMBER;

GRAPH THEORY;

EID: 33750375199     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.06.044     Document Type: Article

References (16)

1. Caro Y., Sebö A., and Tarsi M. Recognizing greedy structures. J. Algorithms 20 (1996) 137-156
2. Christen C.A., and Selkow S.M. Some perfect coloring properties of graphs. J. Combin. Theory Ser. B 27 (1979) 49-59
3. Erdös P., Hare W.R., Hedetniemi S.T., and Laskar R. On the equality of Grundy and ochromatic number of graphs. J. Graph Theory 11 (1987) 157-159
4. Goyal N., and Vishvanathan S. NP-completeness of undirected Grundy numbering and related problems (1997), Manuscript, Bombay
5. Gyárfás A., Király Z., and Lehel J. On-line 3-chromatic graphs-II critical graphs. Discrete Math. 177 (1997) 99-122
6. Gyárfás A., and Lehel J. On-line and first-fit coloring of graphs. J. Graph Theory 12 (1988) 217-227
7. Häggkvist R., Asratian A.S., and Denley T.M.J. Bipartite Graphs and their Applications (1998), Cambridge University Press, Cambridge
8. Hedetniemi S.M., Hedetniemi S.T., and Beyer A. A linear algorithm for the Grundy (coloring) number of a tree. Congr. Numer. 36 (1982) 351-363
9. Hoffman D.G., and Johnson Jr. P.D. Greedy colorings and the Grundy chromatic number of the n-cube. Bull. ICA 26 (1999) 49-57
10. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
11. 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.
12. Simmons G.J. On the ochromatic number of a graph. Congr. Numer. 40 (1983) 339-366
13. Telle J.A., and Proskurowski A. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10 (1997) 529-550
14. Yannakakis M., and Gavril F. Edge dominating sets in graphs. SIAM J. Appl. Math. 38 (1980) 364-372
15. Zaker M. Grundy chromatic number of the complement of bipartite graphs. Australas. J. Combin. 31 (2005) 325-329
16. Z. Füredi, A. Gyárfás, G. Sárközy, S. Selkow, Inequalities for the First-Fit chromatic number (November 2005).