Expected behavior of graph coloring algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 56 LNCS, Issue , 1977, Pages 447-451

  Kucera L ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006630698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-08442-8_114     Document Type: Conference Paper

References (9)

1. P. Erdös and J. Spencer, Probabilistic Method in Combinatorics, Academic Press, New York, 1974.
2. M. R. Garey and D. S. Johnson, The complexity of near-optimal graph coloring, JACM 23, 1 (1976), 43-49.
3. M. R. Garey, D. S. Johnson and L. Stockmayer, Some simplified NP-complete graph problems, Theor. Comput. Sci., 1 (1976)
4. G. R. Grimmett and C. J. H. McDiarmid, On colouring random graphs, Math. Proc. Cambridge Philos. Soc. 77 (1975), 313-324.
5. D. S. Johnson, Worst case behavior of graph coloring algorithms, Proc. of the Fifth Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winipeg, Canada, 1974, 513-528.
6. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plennum Press, New York, 1972, 85-104.
7. D. M. Matula, G. Marble and J. D. Isaacson, Graph coloring algorithms, in Graph Theory and Computing, R. C. Read, Ed., Academic Press, New York, 1972, 109-122.
8. L. Stockmayer, Planar 3-colorability is polynomial complete, ACM SIGACT News, 5, 3 (1973), 19-25.
9. D. J. A. Welsh and M. B. Powell, An upper bound to the chromatic number of a graph and its application to time tabeling problems, Comput. J. 10 (1967), 85-86.