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) ≤ fvs(G) + 3, where fvs(G) denotes the size of a minimum feedback vertex set of G. We show the improved bound of χON(G) ≤ fvs(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 pw(G). The above paper from WADS 2019 showed the upper bound χON(G) ≤ 2 tw(G) + 1 where tw(G) stands for the treewidth of G. This implies an upper bound of χON(G) ≤ 2 pw(G) + 1. We show an improved bound of.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 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. © 2020, Springer Nature Switzerland AG.