By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guruswami, V. ; Lab. for Comput. Sci., MIT, Cambridge, MA, USA ; Khanna, S.

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ε 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 proof is different is that using the PCP theorem we can show that 4-coloring of 3-colorable graphs remains NP-hard even on bounded-degree graphs (this hardness result does not seem to follow from the earlier reduction. We point out that such graphs can always be colored using O(1) colors by a simple greedy algorithm, while the best known algorithm for coloring (general) 3-colorable graphs requires nΩ(1) colours. Our proof technique also shows that there is an ε0>0 such that it is NP-hard to legally 4-color even a (1-ε0) fraction of the edges of a 3-colorable graph

Published in:

Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on

Date of Conference: