15 citations · 39 across the 20 of their papers we have counts for
11 papers · 1 filter
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Subrahmanyam Kalyanasundaram, Subodh Kumar
A conflict-free cut on a simple connected graph is defined as a set of edges such that is disconnected, and no two edges in are conflicti…
A bound for the cops and robber problem in terms of 2-component order connectivity
Suryaansh Jain, Subrahmanyam Kalyanasundaram, Kartheek Sriram Tammana
In the cops and robber game, there are multiple cops and a single robber taking turns moving along the edges of a graph. The goal of the cops is to capture the robber (move to the…
Extremal Results on Conflict-free Coloring
Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram +1
A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open n…
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…
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…
The chromatic discrepancy of graphs
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep +1
For a proper vertex coloring of a graph , let denote the maximum, over all induced subgraphs of , the difference between the chromatic number and the…
A Note on Even Cycles and Quasi-Random Tournaments
Subrahmanyam Kalyanasundaram, Asaf Shapira
A cycle C={v_1,v_2,....,v_1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from v_…
A Wowzer Type Lower Bound for the Strong Regularity Lemma
Subrahmanyam Kalyanasundaram, Asaf Shapira
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to…