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 vertex among v …

In 2002, Even et al. introduced and studied the notion of conflict-free colorings of
geometrically defined hypergraphs. They motivated it by frequency assignment problems in …

A conflict-free k-coloring of a graph G=(V, E) 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 vertex …

Given a graph G, aq-open neighborhood conflict-free coloring or q-ONCF-coloring is a
vertex coloring c: V (G) → {1, 2, ..., q\} c: V (G)→ 1, 2,…, q such that for each vertex v ∈ V (G) …

We study the problem of colouring the vertices of a polygon, such that every viewer can see
a unique colour. The goal is to minimize the number of colours used. This is also known as …

The-Strong Conflict-Free (-SCF colouring problem seeks to find a colouring of the vertices of
a hypergraph using minimum number of colours so that in every hyperedge of, there are at …

Conflict-free coloring (in short, CF-coloring) of a graph G=(V, E) G=(V, E) is a coloring of V
such that the punctured neighborhood of each vertex contains a vertex whose color differs …

Given a set system (also well-known as a hypergraph) H={U, X}, where U is a set of
elements and X is a set of subsets of U, an exact hitting set S is a subset of U such that each …

A conflict-free open neighborhood 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 …

Given a set system (also well-known as a hypergraph) H={U, X}, where U is a set of
elements and X is a set of subsets of U, an exact hitting set S is a subset of U such that each …