How to reduce 3-COLOR to 42-COLOR?
1
The requirement is that two adjacent vertices have different colors, and max. 42 colors. I show that $ text{42-COLOR} $ is in NP and then I must reduce it from $ text{3-COLOR} $ . Here it becomes complicated. Is it similar to $ ktext{-COLOR} $ for any $k$ ?
graphs graph-theory np-complete reductions colorings
share | cite | improve this question
edited Dec 16 at 14:51
xskxzr
3,432 1 7 30
asked Dec 16 at 11:37
gil
6 2
...