A generic NP-hardness proof for a variant of graph coloring

Research output: Contribution to journalArticleAcademicpeer-review

Original languageUndefined/Unknown
Pages (from-to)1114-1124
Number of pages11
JournalJournal of Universal Computer Science
Volume7
Issue number12
Publication statusPublished - 2001

Keywords

  • Wiskunde en Informatica (WIIN)

Cite this