# 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} }

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

On semidefinite programming relaxations for graph coloring and vertex cover

- Computer Science, Mathematics
- 2002

- 51

Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey

- Computer Science, Mathematics
- 2006

- 12
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 27 REFERENCES

Free bits, PCPs and non-approximability-towards tight results

- Mathematics, Computer Science
- 1995

- 331
- PDF

Free Bits, PCPs, and Nonapproximability-Towards Tight Results

- Mathematics, Computer Science
- 1998

- 434
- PDF