Proper conflict-free choosability of sparse graphs with girth at least seven

Xingqin Qi, Huimin Song, Zhulou Cao

A proper conflict-free coloring is a proper vertex coloring in which every non-isolated vertex has a color appearing exactly once in its open neighborhood. We prove that every fini…