On the equality of the partial Grundy and upper ochromatic numbers of graphs

Discrete Mathematics

Volumn 272, Issue 1, 2003, Pages 53-64

  Erdös, Paul ^a   Hedetniemi, Stephen T ^b   Laskar, Renu C ^c   Prins, Geert C E ^d  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b Clemson University   (United States)

^c CLEMSON UNIVERSITY   (United States)

^d WAYNE STATE UNIVERSITY   (United States)

Author keywords

Achromatic number; Chromatic number; Colorings; Grundy number

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COLOR; COMPUTATIONAL METHODS; FUNCTIONS; INTEGER PROGRAMMING; THEOREM PROVING;

CHROMATIC NUMBERS;

GRAPH THEORY;

EID: 0141973660     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00184-5     Document Type: Article

References (36)

1. Berge C. Theory of Graphs and its Applications. 1962;Methuen, London.
2. Berge C. Graphs and Hypergraphs. 1973;North-Holland, Amsterdam.
3. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, American Elsevier, New York, 1976, p. 133.
4. Christen C.A., Selkow S.M. Some perfect coloring properties of graphs. J. Combin. Theory Ser. B. 27:1979;49-59.
5. Christofides N. An algorithm for the chromatic number of a graph. Comput. J. 14:1971;38-39.
6. Cockayne E.J., Thomason A.G. Ordered colourings of graphs. J. Combin. Theory Ser. B. 32:1982;286-292.
7. Erdös P., Hare W.R., Hedetniemi S.T., Laskar R. On the equality of the Grundy and Ochromatic numbers of a graph. J. Graph Theory. 11:1987;157-159.
8. Erdös P., Kubicka E., Schwenk A. Graphs that require many colors to achieve their chromatic sum. Congr. Numer. 71:1990;17-28.
9. Farley A., Hedetniemi S., Mitchell S., Proskurowski A. Minimum broadcast graphs. Discrete Math. 25:1979;189-193.
10. N. Goyal, S. Vishwanathan, NP-completeness of undirected Grundy numbering and related problems, unpublished manuscript, 1997.
11. Grundy P.M. Mathematics and games. Eureka. 2:1939;6-8.
12. Harary F., Hedetniemi S. The achromatic number of a graph. J. Combin. Theory. 8:1970;154-161.
13. Harary F., Hedetniemi S., Prins G. An interpolation theorem for graphical homomorphisms. Portugal. Math. 26:1967;453-462.
14. Hedetniemi S.M., Hedetniemi S.T., Beyer T. A linear algorithm for the Grundy (coloring) number of a tree. Congr. Numer. 36:1982;351-363.
15. Hoffman D.J., Johnson P.D. Jr. Greedy colorings and the Grundy chromatic number of the. n -cube Bull. Inst. Combin. Appl. 26:1999;49-57.
16. Jiang T., West D. Coloring of trees with minimum sum of colors. J. Graph Theory. 32:1999;354-358.
17. D.S. Johnson, Worst case behavior of graph coloring algorithms, in: Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, 1974, pp. 513-527, also Congr. Numer. 10 (1974) 513-528.
18. D.S. Johnson, Worst case behavior of graph coloring algorithms, in: Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, 1974, pp. 513-527, also Congr. Numer. 10 (1974) 513-528.
19. Kubicka E. Constraints on the chromatic sequence for trees and graphs. Congr. Numer. 76:1990;219-230.
20. E. Kubicka, A. Schwenk, Introduction to chromatic sums, Proceedings of the 17th Annual ACM Computer Science Conference, ACM, New York, 1989, pp. 39-45.
21. Marcu D. On finding a Grundy function. Polytech. Inst. Bucharest Sci. Bull. Chem. Mater. Sci. 54(3-4):1992;43-47.
22. Matula D.W., Marble G., Isaacson J.D. Graph coloring algorithms. Read R.C. Graph Theory and Computing. 1972;109-122 Academic Press, New York.
23. McDiarmid C.J.H. Coloring random graphs badly. Wilson R.J. Graph Theory and Combinatorics. 1979;76-86 Pitman, London.
24. Nordhaus E.A., Gaddum J. On complementary graphs. Amer. Math. Monthly. 63:1956;175-177.
25. G. Prins, Unpublished manuscript, dated February 8, 1963.
26. Proskurowski A. Minimum broadcast trees. IEEE Trans. Comput. C-30:1981;363-366.
27. Simmons G.J. The ochromatic number of graphs. Graph Theory Newslett. 11(6):1982;2-3.
28. G.J. Simmons, The ordered chromatic number of planar maps, Proceedings of the 13th Southeastern Conference on Numerical Mathematics and Computing, Boca Raton, FL, 1982, pp. 59-67.
29. Simmons G.J. On the ochromatic number of a graph. Congr. Numer. 40:1983;336-366.
30. Simmons G.J. A graph-theoretical exorcism. Congr. Numer. 49:1985;205-214.
31. Simmons G.J. The ochromatic number of planar graphs. Harary F. Proceedings of the First Colorado Symposium on Graph Theory. 1985;295-316 Wiley, New York.
32. Telle J.A., Proskurowski A. Algorithms for vertex partitioning problems on partial. k -trees SIAM J. Discrete Math. 10:1997;529-550.
33. Thomassen C., Erdös P., Alavi Y., Malde P.J., Schwenk A.J. Tight bounds on the chromatic sum of a connected graph. J. Graph Theory. 13:1989;353-357.
34. Tuza Z. Contractions and minimal. k -colorability Graphs Combin. 6:1990;51-59.
35. Welsh D.J.A., Powell M.B. An upper bound for the chromatic number of a graph and its application to time table problems. Comput. J. 10:1967;85-87.
36. M. Zakar, New trends in greedy colorings of graphs, undated manuscript.