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

@article{Guruswami2000OnTH,
  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},
  year={2000},
  pages={188-197}
}
  • 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

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Conditional hardness for approximate coloring
    • 73
    • PDF
    The hardness of 3-uniform hypergraph coloring
    • 11
    • PDF
    Coloring k-colorable graphs using relatively small palettes
    • 29
    • PDF
    Advice Complexity of the Online Vertex Coloring Problem
    • 12
    List-coloring and sum-list-coloring problems on graphs
    • 14
    • PDF
    Conditional Hardness for Approximate Coloring
    • 76
    • PDF
    Hardness of approximate hypergraph coloring
    • 78
    • PDF
    Constructive generation of very hard 3-colorability instances
    • 36

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES
    On the Hardness of Approximating the Chromatic Number
    • 166
    A Still Better Performance Guarantee for Approximate Graph Coloring
    • 164
    • PDF
    ALGORITHMS FOR APPROXIMATE GRAPH COLORING
    • 37
    • Highly Influential
    • PDF
    Free bits, PCPs and non-approximability-towards tight results
    • 331
    • PDF
    The Complexity of Near-Optimal Graph Coloring
    • 275
    On the hardness of approximating minimization problems
    • 546
    Zero knowledge and the chromatic number
    • 247
    An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs
    • 132
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results
    • 434
    • PDF
    Hardness of approximate hypergraph coloring
    • 78
    • PDF