Abstract
A vertex coloring of a graph is said to be 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., Proper Conflict-free and Unique-maximum Colorings of Planar Graphs with Respect to Neighborhoods, arXiv preprint], the minimum number of colors in any such proper coloring of graph G is the PCF chromatic number of G, denoted χpcf(G). In this paper, we determine the value of this graph parameter for several basic graph classes including trees, cycles, hypercubes and subdivisions of complete graphs. We also give upper bounds on χpcf(G) in terms of other graph parameters. In particular, we show that χpcf(G)≤5Δ(G)/2 and characterize equality. Several sufficient conditions for PCF k-colorability of graphs are established for 4≤k≤6. The paper concludes with few open problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
