Extremal Results

A conflict-free open neighborhood (CFON) coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open neighborhood. For a graph $G$, the smallest number of colors …