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

Xingqin Qi, Huimin Song, Zhulou Cao

A proper conflict-free coloring of a graph is a proper vertex coloring in which every non-isolated vertex has a color appearing exactly once in its neighborhood. A graph $G$ is pro…