1 paper
Zachary Abel, Victor Alvarez, Aman Gour +5
A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vert…