A generic NP-hardness proof for a variant of Graph Coloring

H.L. Bodlaender

Research output: Contribution to journalArticleAcademicpeer-review

Fingerprint

Dive into the research topics of 'A generic NP-hardness proof for a variant of Graph Coloring'. Together they form a unique fingerprint.

Computer Science

Mathematics