Four colours are needed for closed-neighbourhood conflict-free colouring of all planar graphs

Jelena Sedlar, Riste Škrekovsk

A colouring of the vertices of a graph is conflict-free with respect to closed neighbourhoods if every closed neighbourhood contains a colour that appears on exactly one of its ver…