Swati Kumari

collaborators

3 papers

cs.DS2025

On the Parameterized Complexity of Odd Coloring

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

A proper vertex coloring of a connected graph $G$ is called an odd coloring if, for every vertex $v$ in $G$ , there exists a color that appears odd number of times in the open neigh…

math.CO2023

Star Coloring of Tensor Product of Two Graphs

Harshit Kumar Choudhary, Swati Kumari, I. Vinod Reddy

A star coloring of a graph $G$ is a proper vertex coloring such that no path on four vertices is bicolored. The smallest integer $k$ for which $G$ admits a star coloring with $k$ c…

math.CO2023

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

For a positive integer $k$ , a proper $k$ -coloring of a graph $G$ is a mapping $f : V (G) \to {1, 2, \dots, k}$ such that $f (u) \neq = f (v)$ for each edge $uv$ of $G$ . The sma…