Abstract Let H=(V, E) be a hypergraph. A conflict-free coloring of H is an assignment of
colors to V such that, in each hyperedge e∈ E, there is at least one uniquely-colored vertex …

A colouring of the vertices of a hypergraph H is called conflict-free if each hyperedge E of H
contains a vertex of 'unique'colour that does not get repeated in E. The smallest number of …

Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles
is a graph defined on the vertex set P, whose two points p, q∈ P are connected by an edge …

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 …

Graph and hypergraph colorings constitute an important subject in combinatorics and
algorithm theory. In this work, we study conflict-free coloring for hypergraphs. Conflict-free …

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 …

We provide a framework for online conflict-free colouring of any hypergraph. We introduce
the notion of a degenerate hypergraph, which characterizes hypergraphs that arise in …

We present randomized algorithms for online conflict-free coloring (CF in short) of points in
the plane, with respect to halfplanes, congruent disks, and nearly-equal axis-parallel …

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 …

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined
by geometric regions. This problem has close relations to conflict-free colorings. One of the …