Abstract

Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring c: V(G) → { 1, 2, …, q} such that for each vertex v∈ V(G) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(v). When we
... read more