15 citations · 16 across the 5 of their papers we have counts for
9 papers
A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Given an undirected graph , a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colore…
Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in it…
Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
In an undirected graph , 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…
Conflict-free coloring on closed neighborhoods of bounded degree graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The closed neighborhood conflict-free chromatic number of a graph , denoted by , is the minimum number of colors required to color the vertices of such that for e…
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…
Bipartitioning Problems on Graphs with Bounded Tree-Width
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induc…