Searching for "On the Hardness of 4-Coloring a 3-Colorable Graph." – sorted by Relevance.
3 documents found, showing 1 through 3.
-
On the Hardness of 4-coloring a 3-colorable Graph
- …On the Hardness of 4-coloring a 3-colorable Graph Venkatesan Guruswami y Sanjeev Khanna z…
- Cited by 14 (1 self) – Add To MetaCart
-
On semidefinite programming relaxations for graph coloring and vertex cover
- … is that it is NP-Hard to 4-color a 3-colorable graph (see Khanna, Linial and Safra [19] as well as Guruswami…
- Cited by 13 (0 self) – Add To MetaCart
-
Completeness in the boolean hierarchy: Exact-FourColorability, minimal graph uncolorability
- … the chromatic number of 3-colorable graphs. Intuitively, their result says that it is NP-hard to 4-color a 3…
- Cited by 2 (2 self) – Add To MetaCart
Showing 1 through 3.
