Planar graph coloring is not self-reducible, assuming P ≠ NP

Samir Khuller*, Vijay V. Vazirani

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Fingerprint Dive into the research topics of 'Planar graph coloring is not self-reducible, assuming P ≠ NP'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science