3 citations · 4 across the 12 of their papers we have counts for
14 papers
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 vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-…
On -chromatic numbers of graphs having bounded sparsity parameters
Sandip Das, Abhiruk Lahiri, Soumen Nandi +2
An -graph is characterised by having types of arcs and types of edges. A homomorphism of an -graph to an -graph , is a vertex mapping that prese…
On coloring parameters of triangle-free planar -graphs
Soumen Nandi, Sagnik Sen, S Taruni
An -graph is a graph with types of arcs and types of edges. A homomorphism of an -graph to another -graph is a vertex mapping that preserves th…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…
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 , which completely answers and closes a…
A linear algorithm for radio -coloring of powers of paths having small diameters
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen +1
The radio -chromatic number of a graph is the minimum integer such that there exists a function satisfying $|ϕ(u)-ϕ(v)| \geq k+…