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

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856749 ◽

2002 ◽

Cited By ~ 9

Author(s):

V. Guruswami ◽

S. Khanna

Download Full-text