On the Hardness of Approximating the Chromatic Number (1993)
by
Sanjeev Khanna University
,
Sanjeev Khanna
,
Nathan Linial
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{University93onthe,
author = {Sanjeev Khanna University and Sanjeev Khanna and Nathan Linial},
title = {On the Hardness of Approximating the Chromatic Number},
year = {1993}
}
author = {Sanjeev Khanna University and Sanjeev Khanna and Nathan Linial},
title = {On the Hardness of Approximating the Chromatic Number},
year = {1993}
}
Bookmarks
OpenURL
Abstract:
We study the hardness of approximating the chromatic number when the input graph is k-colorable for some xed k 3. Our main result is that it is NP-hard to nd a 4-coloring of a 3-chromatic graph. As an immediate corollary we obtain that it is NP-hard to color a k-chromatic graph with at most k + 2bk=3c 1 colors. We also give simple proofs of two results of Lund and Yannakakis [20]. The rst result shows that it is NP-hard to approximate the chromatic number to within n for some xed > 0.
