NP-Hardness of Almost Coloring Almost 3-Colorable Graphs

Yahli Hecht*, Dor Minzer*, Muli Safra*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Fingerprint

Dive into the research topics of 'NP-Hardness of Almost Coloring Almost 3-Colorable Graphs'. Together they form a unique fingerprint.

Keyphrases

Mathematics