| Title: |
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs |
| Article URLs: |
|
| Alternative Article URLs: |
https://arxiv.org/abs/1701.05999 |
| Authors: |
Zachary Abel |
-
Massachusetts Institute of Technology, Mathematics Department
|
| Victor Alvarez |
-
TU Braunschweig, Algorithms Group
|
| Erik D. Demaine |
-
Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory
|
| Sándor P. Fekete |
-
TU Braunschweig, Algorithms Group
|
| Aman Gour |
-
Indian Institute of Technology Bombay, Computer Science and Engineering
|
| Adam Hesterberg |
-
Massachusetts Institute of Technology, Mathematics Department
|
| Phillip Keldenich |
-
TU Braunschweig, Algorithms Group
|
| Christian Scheffer |
-
TU Braunschweig, Algorithms Group
|
| Sharing: |
Research produced no artifacts
|
| Verification: |
Authors have
verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/soda/AbelADFGHKS17
|
| Author Comments: |
|