On the hardness of 4-coloring a 3-collorable graph

  title={On the hardness of 4-coloring a 3-collorable graph},
  author={V. Guruswami and S. Khanna},
  journal={Proceedings 15th Annual IEEE Conference on Computational Complexity},
  • V. Guruswami, S. Khanna
  • Published 2000
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. This result is already known, but our proof is novel as it does not rely on the PCP theorem. This highlights a qualitative difference between the known hardness result for coloring 3-colorable graphs and the factor n/sup /spl epsiv// hardness for approximating the chromatic number of general graphs, as the latter result is known to imply (some form of) PCP theorem. Another aspect in which our… CONTINUE READING
    26 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    The hardness of 3-uniform hypergraph coloring
    • 12
    • PDF
    Conditional hardness for approximate coloring
    • 74
    • PDF
    Advice Complexity of the Online Vertex Coloring Problem
    • 12
    List-coloring and sum-list-coloring problems on graphs
    • 14
    • PDF
    Coloring k-colorable graphs using relatively small palettes
    • 29
    • PDF
    Hardness of approximate hypergraph coloring
    • 1
    • PDF
    Constructive generation of very hard 3-colorability instances
    • 36
    Conditional Hardness for Approximate Coloring
    • 76
    • PDF
    On semidefinite programming relaxations for graph coloring and vertex cover
    • 52


    On the Hardness of Approximating the Chromatic Number
    • 165
    • 37
    • Highly Influential
    • PDF
    A Still Better Performance Guarantee for Approximate Graph Coloring
    • 167
    • PDF
    Improved hardness results for approximating the chromatic number
    • M. Furer
    • Proceedings of IEEE 36th Annual Foundations of Computer Science
    • 1995
    • 10
    • Highly Influential
    Free bits, PCPs and non-approximability-towards tight results
    • 337
    • PDF
    An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs
    • 131
    The Complexity of Near-Optimal Graph Coloring
    • 275
    Hardness of approximate hypergraph coloring
    • 78
    • PDF
    Zero knowledge and the chromatic number
    • U. Feige, J. Kilian
    • Mathematics, Computer Science
    • Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
    • 1996
    • 246
    On the hardness of approximating minimization problems
    • 529