Expected behavior of graph coloring algorithms

  • L. Kučera
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Erdös and J. Spencer, Probabilistic Method in Combinatorics, Academic Press, New York, 1974.Google Scholar
  2. 2.
    M.R. Garey and D.S. Johnson, The complexity of near-optimal graph coloring, JACM 23, 1 (1976), 43–49.Google Scholar
  3. 3.
    M.R. Garey, D.S. Johnson and L. Stockmayer, Some simplified NP-complete graph problems, Theor. Comput. Sci., 1 (1976)Google Scholar
  4. 4.
    G.R. Grimmett and C.J.H. McDiarmid, On colouring random graphs, Math. Proc. Cambridge Philos. Soc. 77 (1975), 313–324.Google Scholar
  5. 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.Google Scholar
  6. 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.Google Scholar
  7. 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.Google Scholar
  8. 8.
    L. Stockmayer, Planar 3-colorability is polynomial complete, ACM SIGACT News, 5, 3 (1973), 19–25.Google Scholar
  9. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • L. Kučera
    • 1
  1. 1.Charles UniversityPragueCzechoslovakia

Personalised recommendations