Soumen Nandi

collaborators

3 papers

cs.DM2026

On homomorphism related parameters of oriented triangle-free planar graphs

Soura Sena Das, Soumen Nandi, Sagnik Sen

The first major contribution of this work is proving that the oriented relative clique number of oriented triangle-free planar graphs is $10$ , which completely answers and closes a…

math.CO2024

On locating and neighbor-locating colorings of sparse graphs

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2

A proper $k$ -coloring of a graph $G$ is a \emph{neighbor-locating $k$ -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…

math.CO2024

A linear algorithm for radio $k$ -coloring of powers of paths having small diameters

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen +1

The radio $k$ -chromatic number $r c_{k} (G)$ of a graph $G$ is the minimum integer $I^»$ such that there exists a function $I ¨ : V (G) \to {0, 1, \dots, I^»}$ satisfying $|Ï(u)-Ï(v)| \g…

On homomorphism related parameters of oriented triangle-free planar graphs

On locating and neighbor-locating colorings of sparse graphs

A linear algorithm for radio k-coloring of powers of paths having small diameters

A linear algorithm for radio $k$ -coloring of powers of paths having small diameters