12 citations · 14 across the 13 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang +2
A conflict-free coloring of a graph is a (partial) coloring of its vertices such that every vertex has a neighbor whose assigned color is unique in the neighborhood of .…
cs.DM2019
Conflict-Free Coloring on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
In an undirected graph, a conflict-free coloring (with respect to open neighborhoods) is an assignment of colors to the vertices of the graph such that every vertex in has…