1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Petr Hliněný, Lukáš Málik
We efficiently conflict-free color every planar graph with 4 colors. An (open-neighborhood) conflict-free coloring assigns colors to vertices in a way that every vertex v has a nei…