Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Graph Coloring

  • Michael Langberg
  • Chandra  Chekuri
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_170-2

Keywords and Synonyms

Clique cover, Graph coloring, Approximation algorithms, Semidefinite

Years and Authors of Summarized Original Work

1994, 1998; Karger, Motwani, Sudan

Problem Definition

An independent set in an undirected graph G = (V, E) is a set of vertices that induce a subgraph which does not contain any edges. The size of the maximum independent set in G is denoted by α(G). For an integer k, a k-coloring of G is a function \(\sigma : V \rightarrow [1\ldots k]\)


Approximation Ratio Chromatic Number Vertex Cover Graph Coloring Color Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Blum A (1994) New approximations for graph coloring. J ACM 41(3):470–516CrossRefzbMATHGoogle Scholar
  2. 2.
    Blum A, Karger D (1997) An \(\tilde{O}(n^{3/14})\)-coloring for 3-colorable graphs. Inf Process Lett 61(6):49–53CrossRefMathSciNetGoogle Scholar
  3. 3.
    Chaitin GJ (1982) Register allocation & spilling via graph coloring. In: Proceedings of the 1982 SIGPLAN symposium on compiler construction, pp 98–105Google Scholar
  4. 4.
    Chaitin GJ, Auslander MA, Chandra AK, Cocke J, Hopkins ME, Markstein PW (1981) Register allocation via coloring. Comput Lang 6:47–57CrossRefGoogle Scholar
  5. 5.
    Chlamtac E (2007) Approximation algorithms using hierarchies of semidefinite programming relaxations. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp 691–701Google Scholar
  6. 6.
    Dinur I, Mossel E, Regev O (2009) Conditional hardness for approximate coloring. SIAM J Comput 39(3):843–873CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Feige U (1997) Randomized graph products, chromatic numbers, and the Lovász theta function. Combinatorica 17(1):79–90CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Feige U (2004) Approximating maximum clique by removing subgraphs. SIAM J Discret Math 18(2):219–225CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Feige U, Kilian J (1998) Zero knowledge and the chromatic number. J Comput Syst Sci 57:187–199CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Feige U, Langberg M, Schechtman G (2004) Graphs with tiny vector chromatic numbers and huge chromatic numbers. SIAM J Comput 33(6):1338–1368CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Guruswami V, Khanna S (2000) On the hardness of 4-coloring a 3-colorable graph. In: Proceedings of the 15th annual IEEE conference on computational complexity, pp 188–197Google Scholar
  12. 12.
    Halldorsson M (1993) A still better performance guarantee for approximate graph coloring. Inf Process Lett 45:19–23CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Halperin E, Nathaniel R, Zwick U (2002) Coloring k-colorable graphs using smaller palettes. J Algorithms 45:72–90CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Håstad J (1999) Clique is hard to approximate within \(n^{1-\epsilon }\). Acta Math 182(1):105–142CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Kawarabayashi K, Thorup M (2012) Combinatorial coloring of 3-Colorable graphs. In: Proceedings of the 53rd annual IEEE symposium on foundations of computer science, pp 68–75Google Scholar
  16. 16.
    Kawarabayashi K, Thorup M (2014) Coloring 3-colorable graphs with o(n 1 ∕ 5) colors. In: Proceedings of the 31st international symposium on theoretical aspects of computer science, pp 458–469Google Scholar
  17. 17.
    Karger D, Motwani R, Sudan M (1998) Approximate graph coloring by semidefinite programming. J ACM 45(2):246–265CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Khanna S, Linial N, Safra S (2000) On the hardness of approximating the chromatic number. Combinatorica 20:393–415CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Khot S (2001) Improved inapproximability results for max clique, chromatic number and approximate graph coloring. In: Proceedings of the 42nd annual IEEE symposium on foundations of computer science, pp 600–609Google Scholar
  20. 20.
    Khot S (2002) On the power of unique 2-prover 1-round games. In: Proceedings of the 34th annual ACM symposium on theory of computing, pp 767–775Google Scholar
  21. 21.
    Lovász L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory 25:2–13CrossRefGoogle Scholar
  22. 22.
    Wigderson A (1983) Improving the performance guarantee for approximate graph coloring. J ACM 30(4):729–735CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Zuckerman D (2006) Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the 38th annual ACM symposium on theory of computing, pp 681–690Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Department of Electrical Engineering, The State University of New York at BuffaloBuffalo, NYUSA