# 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

The hardness of 3-uniform hypergraph coloring

- Computer Science, Mathematics
- The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
- 2002

12- PDF

Coloring k-colorable graphs using relatively small palettes

- Mathematics, Computer Science
- J. Algorithms
- 2002

29- PDF

Hardness of approximate hypergraph coloring

- Computer Science
- Proceedings 41st Annual Symposium on Foundations of Computer Science
- 2000

1- PDF

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

- Computer Science, Mathematics
- J. Univers. Comput. Sci.
- 2006

12- PDF

Constructive generation of very hard 3-colorability instances

- Mathematics, Computer Science
- Discret. Appl. Math.
- 2008

36

On semidefinite programming relaxations for graph coloring and vertex cover

- Computer Science, Mathematics
- SODA '02
- 2002

52

#### References

SHOWING 1-10 OF 27 REFERENCES

A Still Better Performance Guarantee for Approximate Graph Coloring

- Computer Science
- Inf. Process. Lett.
- 1993

167- PDF

Improved hardness results for approximating the chromatic number

- Proceedings of IEEE 36th Annual Foundations of Computer Science
- 1995

10 Highly Influential

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

- Mathematics, Computer Science
- Proceedings of IEEE 36th Annual Foundations of Computer Science
- 1995

337- PDF

An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1997

131

Hardness of approximate hypergraph coloring

- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2000

78- PDF

Zero knowledge and the chromatic number

- Mathematics, Computer Science
- Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
- 1996

246