Xing-Qin Qi

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

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 proper conflict-free $(\mathrm{degree}+2)$-choosable if every list assignment $L$ with $|L(v)|\ge d_G(v)+2$ for each $v\in V(G)$ admits such a...