Grundy chromatic number of the complement of bipartite graphs

Australasian Journal of Combinatorics

Volumn 31, Issue , 2005, Pages 325-329

  Zaker, Manouchehr ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750338013     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. M. Behzad, Graphs and their chromatic numbers, Ph.D. dissertation, Michigan State University, Department of Mathematics, 1965.
2. C.A. Christen and S.M. Selkow, Some perfect coloring properties of graphs, J. Combin. Theory Ser. B 27 (1979), 49-59.
3. P. Erdo{double acute}s, W.R. Hare, S.T. Hedetniemi and R. Laskar, On the equality of the Grundy and ochromatic numbers of a graph, J. Graph Theory 11 (1987), 157-159.
4. N. Goyal and S. Vishvanathan, NP-completeness of undirected Grundy numbering and related problems, Manuscript, Bombay 1997.
5. R. Häggkvist, A.S. Asratian and T.M.J. Denley, Bipartite graphs and their applications, Cambridge University Press, Cambridge, 1998.
6. S.M. Hedetniemi, S.T. Hedetniemi and T. Beyer, A linear algorithm for the Grundy (coloring) number of a tree, Congr. Num. 36 (1982), 351-363.
7. D.G. Hoffman and P.D. Johnson Jr., Greedy colorings and the Grundy chromatic number of the n-cube, Bulletin of the ICA 26 (1999), 49-57.
8. T.R. Jensen and B. Toft, Graph coloring problems, John Wiley & Sons, 1995.
9. J.A. Telle and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM J. Discrete Math, 10 (1997), 529-550.
10. M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math, 38 (1980), 364-372.
11. M. Zaker, Results on the Grundy chromatic number of graphs, Manuscript, 2003.