1 paper
Yuxin Jin, Yuping Gao
An edge coloring of a graph G is called conflict-free if, for every edge, its closed neighborhood contains a color that appears exactly once. The least number of colors required…