L’Aquila, Italy · Conference website ↗
Conflict-Free Coloring Planar Graphs with 4 Colors
34th Annual European Symposium on Algorithms (ESA 2026), LIPIcs 388, Article 33.
We prove that every planar graph admits an open-neighborhood conflict-free coloring using at most four colors, and give a polynomial-time algorithm.