The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the closed neighborhood (a vertex and its neighbors) of every vertex. This paper presents recent findings and heuristics to solve the conflict-free coloring problem on both general graphs and planar graphs.
"Conflict-Free Vertex Coloring Of Planar Graphs,"
Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal: Vol. 4
, Article 8.
Available at: http://digitalcommons.morris.umn.edu/horizons/vol4/iss2/8