Related papers: Combinatorial Bounds for Conflict-free Coloring on…
Given an undirected graph $G = (V,E)$, a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of…
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in its open neighborhood. The smallest number of colors required…
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph $G$ using $r$ colors is a coloring of the vertices of $G$ such that every vertex sees some color exactly once in its open (closed)…
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 neighborhood. For a graph $G$, the smallest number of colors…
A vertex coloring of a graph is said to be \textit{conflict-free} with respect to neighborhoods if for every non-isolated vertex there is a color appearing exactly once in its (open) neighborhood. As defined in [Fabrici et al.,…
The closed neighborhood conflict-free chromatic number of a graph $G$, denoted by $\chi_{CN}(G)$, is the minimum number of colors required to color the vertices of $G$ such that for every vertex, there is a color that appears exactly once…
The conflict-free closed neighborhood (CFCN$^*$) chromatic number of a graph $G = (V,E)$ is the smallest positive integer $k$ for which there exists a coloring of a subset of vertices using $k$ colors such that, for every vertex in $V$,…
Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring $c:V(G) \rightarrow \{1,2,\ldots,q\}$ such that for each vertex $v \in V(G)$ there is a vertex in $N(v)$ that is uniquely colored from the…
A proper vertex colouring of a graph $G$ is referred to as conflict-free if in the neighbourhood of every vertex some colour appears exactly once, while it is called $h$-conflict-free if there are at least $h$ such colours for each vertex…
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 and v's neighbors. Such colorings have…
In an undirected graph, a conflict-free coloring (with respect to open neighborhoods) is an assignment of colors to the vertices of the graph $G$ such that every vertex in $G$ has a uniquely colored vertex in its open neighborhood. The…
Conflict-free coloring (in short, CF-coloring) of a graph $G = (V,E)$ is a coloring of $V$ such that the neighborhood of each vertex contains a vertex whose color differs from the color of any other vertex in that neighborhood. Bounds on…
A vertex coloring of a given graph $G$ is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). The minimum number of colors in such a coloring is the…
A '(partial) conflict-free coloring' of a hypergraph $\mathcal{H}$ is an assignment of colors to (a subset of) the vertex set of $\mathcal{H}$ such that every hyperedge in $\mathcal{H}$ has a vertex whose color is distinct from every other…
The proper conflict-free chromatic number, $\chi_{pcf}(G)$, of a graph $G$ is the least $k$ such that $G$ has a proper $k$-coloring in which for each non-isolated vertex there is a color appearing exactly once among its neighbors. The…
A conflict-free coloring of a graph $G$ is a (partial) coloring of its vertices such that every vertex $u$ has a neighbor whose assigned color is unique in the neighborhood of $u$. There are two variants of this coloring, one defined using…
A proper $k$-colouring of a graph $G$ is called $h$-conflict-free if every vertex $v$ has at least $\min\, \{h, {\rm deg}(v)\}$ colours appearing exactly once in its neighbourhood. Let $\chi_{\rm pcf}^h(G)$ denote the minimum $k$ such that…
A vertex-coloring of a connected graph $G$ is a strong conflict-free vertex-connection coloring if every two distinct vertices are joined by a shortest path on which some color appears exactly once. The minimum number of colors in such a…
The conflict-free chromatic index of a graph $G$ is the minimum number of colours in an edge colouring of $G$ such that the neighbourhood of every edge contains a colour appearing exactly once. Its vertex analogue is the conflict-free…
Let $G$ be a graph with maximum degree $\Delta$ and without isolated vertices. An edge colouring $c$ of $G$ is conflict-free if the closed neighbourhood of every edge includes a uniquely coloured element. The least number of colours…