15 citations · 39 across the 20 of their papers we have counts for
3 papers · 1 filter
Conflict-free coloring on open neighborhoods of claw-free graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph using colors is a coloring of the vertices of such that every vert…
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 .…
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requ…