7 papers · 1 filter
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-…
Cops and robber on variants of retracts and subdivisions of oriented graphs
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
\textsc{Cops and Robber} is one of the most studied two-player pursuit-evasion games played on graphs, where multiple \textit{cops}, controlled by one player, pursue a single \text…
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…
Triangle-free projective-planar graphs with diameter two: domination and characterization
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee +2
In 1975, Plesník characterized all triangle-free planar graphs as having a diameter . We characterize all triangle-free projective-planar graphs having a diameter and discus…
On fractional version of oriented coloring
Sandip Das, Soham Das, Swathy Prabhu +1
We introduce the fractional version of oriented coloring and initiate its study. We prove some basic results and study the parameter for directed cycles and sparse planar graphs. I…