Abstract
The paper considers the computational hardness of approximating the chromatic number of a graph. The authors first give a simple proof that approximating the chromatic number of a graph to within a constant power (of the value itself) in NP-hard. They then consider the hardness of coloring a 3-colorable graph with as few as possible colors. They show that determining whether a graph is 3-colorable or any legal coloring of it requires at least 5 colors is NP-hard. Therefore, coloring a 3-colorable graph with 4 colors is NP-hard.
| Original language | English |
|---|---|
| Title of host publication | 2nd Israel Symposium on Theory and Computing Systems |
| Subtitle of host publication | ISTCS 1993 |
| Publisher | IEEE Computer Society |
| Pages | 250-260 |
| Number of pages | 11 |
| ISBN (Print) | 0-8186-3630-0 |
| DOIs | |
| State | Published - 1993 |
| Event | 2nd Israel Symposium on Theory and Computing Systems, ISTCS 1993 - Natanya, Israel Duration: 7 Jun 1993 → 9 Jun 1993 Conference number: 2 https://www.computer.org/csdl/proceedings/istcs/1993/12OmNyS6RMM |
Conference
| Conference | 2nd Israel Symposium on Theory and Computing Systems, ISTCS 1993 |
|---|---|
| Abbreviated title | ISTCS 1993 |
| Country/Territory | Israel |
| City | Natanya |
| Period | 7/06/93 → 9/06/93 |
| Internet address |
Keywords
- Computational complexity
- Computational geometry
- Graph coloring
- NP-hard