A Generic NP-hardness Proof for a Variant of Graph Coloring

Hans Leo Bodlaender. A Generic NP-hardness Proof for a Variant of Graph Coloring. J. UCS, 7(12):1114-1124, 2001. [doi]

Abstract

Abstract is missing.