Conflict-Free Coloring Bounds on Open Neighborhoods

In an undirected graph G , a conflict-free coloring with respect to open neighborhoods (denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for a CFON coloring of G is the CFON chromatic number of G , denoted by χ _ON(G) . The decision problem that asks whether χ _ON(G)≤ k is NP-complete. Structural as well as algorithmic aspects of this problem have been well studied. We obtain the following results for χ _ON(G) : Bodlaender, Kolay and Pieterse (WADS 2019) showed the upper bound χ _ON(G)≤𝖿𝗏𝗌(G) + 3 , where 𝖿𝗏𝗌(G) denotes the size of a minimum feedback vertex set of G . We show the improved bound of χ _ON(G)≤𝖿𝗏𝗌(G) + 2 , which is tight, thereby answering an open question in the above paper. We study the relation between χ _ON(G) and the pathwidth of the graph G , denoted 𝗉𝗐(G) . The above paper from WADS 2019 showed the upper bound χ _ON(G)≤ 2𝗍𝗐(G) + 1 where 𝗍𝗐(G) stands for the treewidth of G . This implies an upper bound of χ _ON(G)≤ 2𝗉𝗐(G) + 1 . We show an improved bound of χ _ON(G)≤⌊5/3(𝗉𝗐(G) + 1)⌋ . We prove new bounds for χ _ON(G) with respect to the structural parameters neighborhood diversity and distance to cluster, improving the existing results of Gargano and Rescigno (Theor. Comput. Sci. 2015) and Reddy (Theor. Comput. Sci. 2018), respectively. Furthermore, our techniques also yield improved bounds for the closed neighborhood variant of the problem. We prove bounds for S_k -free graphs where S_k is a star on k+1 vertices. For a graph G with maximum degree Δ , it is known that χ _ON(G)≤Δ + 1 and this bound is tight in general. When G is S_k -free, we show that χ _ON(G)= O(k·log ^2+ϵΔ ) , for any ϵ > 0 . In particular, when G is claw-free, this implies that χ _ON(G)= O(log ^2 + ϵΔ ) . Further, we show existence of claw-free graphs that require Ω (logΔ ) colors. We also study the partial coloring variant of the CFON coloring problem, which allows vertices to be left uncolored. Let χ ^*_ON(G) denote the minimum number of colors required to color G as per this variant. Abel et al. (SIDMA 2018) showed that χ ^*_ON(G)≤ 8 when G is planar. They asked if fewer colors would suffice for planar graphs. We answer this question by showing that χ ^*_ON(G)≤ 5 for all planar G . This approach also yields the bound χ ^*_ON(G)≤ 4 for all outerplanar G . All our bounds are a result of constructive algorithmic procedures.