2 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
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 Structural Parameterizations of Load Coloring
I. Vinod Reddy
Given a graph and a positive integer , the 2-Load coloring problem is to check whether there is a -coloring of such that for every $i \in…
Parameterized Coloring Problems on Threshold Graphs
I. Vinod Reddy
In this paper, we study several coloring problems on graphs from the viewpoint of parameterized complexity. We show that Precoloring Extension is fixed-parameter tractable (FPT) pa…
On Structural Parameterizations of Firefighting
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra +1
The Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step , a firefighter permanently defends (protects)…
Parameterized Algorithms for Conflict-free Colorings of Graphs
I. Vinod Reddy
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its n…
The Parameterized Complexity of Happy Colorings
Neeldhara Misra, I. Vinod Reddy
Consider a graph and a coloring of vertices with colors from . A vertex is said to be happy with respect to if for all neighbors o…