Skip to main content
SpringerLink
Log in

Expected behavior of graph coloring algorithms

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Erdös and J. Spencer, Probabilistic Method in Combinatorics, Academic Press, New York, 1974.

    Google Scholar 

  2. M.R. Garey and D.S. Johnson, The complexity of near-optimal graph coloring, JACM 23, 1 (1976), 43–49.

    Google Scholar 

  3. M.R. Garey, D.S. Johnson and L. Stockmayer, Some simplified NP-complete graph problems, Theor. Comput. Sci., 1 (1976)

    Google Scholar 

  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. 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. 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. 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. L. Stockmayer, Planar 3-colorability is polynomial complete, ACM SIGACT News, 5, 3 (1973), 19–25.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Charles University, Prague, Czechoslovakia

    L. Kučera

Authors
  1. L. Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, L. (1977). Expected behavior of graph coloring algorithms. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation