12 citations · 14 across the 13 of their papers we have counts for
14 papers
Algorithms for the Maximum Edge Open Packing Problem
Sriram Bhyravarapu, Gautam K. Das, Kamal Santra
Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motiva…
On the Parameterized Complexity of Odd Coloring
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
A proper vertex coloring of a connected graph is called an odd coloring if, for every vertex in , there exists a color that appears odd number of times in the open neigh…
On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
For a positive integer , a proper -coloring of a graph is a mapping such that for each edge of . The sma…
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…
Parameterized algorithms for Eccentricity Shortest Path Problem
Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh +2
Given an undirected graph and an integer , the Eccentricity Shortest Path (ESP) asks to find a shortest path such that for every vertex , there is a…
On Structural Parameterizations of Star Coloring
Sriram Bhyravarapu, I. Vinod Reddy
A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a…
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 .…
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…
On the Tractability of (k,i)-Coloring
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…