On the Hardness of 4-coloring a 3-colorable Graph (2000) [14 citations — 1 self]
Download:
http://www.cis.upenn.edu/~cisfac/sanjeev/postscrip
ftp://theory.lcs.mit.edu/pub/people/venkat/3colori
DBLP
CACHED:
|
http://www.cis.upenn.edu/~cisfac/sanjeev/postscrip
ftp://theory.lcs.mit.edu/pub/people/venkat/3colori
DBLP
CACHED:
|
by
Venkatesan Guruswami
,
Sanjeev Khanna
In Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Guruswami00onthe,
author = {Venkatesan Guruswami and Sanjeev Khanna},
title = {On the Hardness of 4-coloring a 3-colorable Graph},
booktitle = {In Proceedings of the 15th Annual IEEE Conference on Computational Complexity},
year = {2000},
pages = {188--197},
publisher = {IEEE Computer Society Press}
}
author = {Venkatesan Guruswami and Sanjeev Khanna},
title = {On the Hardness of 4-coloring a 3-colorable Graph},
booktitle = {In Proceedings of the 15th Annual IEEE Conference on Computational Complexity},
year = {2000},
pages = {188--197},
publisher = {IEEE Computer Society Press}
}
Bookmarks
OpenURL
Abstract:
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 [19], but our proof is novel as it does not rely on the PCP theorem, while the one in [19] does. This highlights a qualitative difference between the known hardness result for coloring 3-colorable graphs and the factor n hardness for approximating the chromatic number of general graphs, as the latter result is known to imply (some form of) PCP theorem [3].
