12 citations · 14 across the 13 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…