Soumen Nandi

activity

20162023

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2023

A theoretical expansion of the Sprout game

Soura Sena Das, Zin Mar Myint, Soumen Nandi +2

Sprout is a two-player pen and paper game which starts with $n$ vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-…

math.CO2023

On $(n, m)$ -chromatic numbers of graphs having bounded sparsity parameters

Sandip Das, Abhiruk Lahiri, Soumen Nandi +2

An $(n, m)$ -graph is characterised by having $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n, m)$ -graph $G$ to an $(n, m)$ -graph $H$ , is a vertex mapping that prese…

math.CO2023

On coloring parameters of triangle-free planar $(n, m)$ -graphs

Soumen Nandi, Sagnik Sen, S Taruni

An $(n, m)$ -graph is a graph with $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n, m)$ -graph $G$ to another $(n, m)$ -graph $H$ is a vertex mapping that preserves th…

math.CO2016

Chromatic number of signed graphs with bounded maximum degree

Sandip Das, Soumen Nandi, Soumyajit Paul +1

A signed graph $(G, Σ)$ is a graph positive and negative ( $Σ$ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $(G, Σ)$ is to switch the signs of the…

A theoretical expansion of the Sprout game

On (n,m)-chromatic numbers of graphs having bounded sparsity parameters

On coloring parameters of triangle-free planar (n,m)-graphs

Chromatic number of signed graphs with bounded maximum degree

On $(n, m)$ -chromatic numbers of graphs having bounded sparsity parameters

On coloring parameters of triangle-free planar $(n, m)$ -graphs