3 citations · 4 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
On the signed chromatic number of some classes of graphs
Julien Bensmail, Sandip Das, Soumen Nandi +3
A signed graph is a graph along with a function . A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) num…
Pushable chromatic number of graphs with degree constraints
Julien Bensmail, Sandip Das, Soumen Nandi +4
Pushable homomorphisms and the pushable chromatic number of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any orie…
On relative clique number of colored mixed graphs
Sandip Das, Soumen Nandi, Debdeep Roy +1
An -colored mixed graph is a graph having arcs of different colors and edges of different colors. A graph homomorphism of an )-colored mixed graph to an…
On chromatic number of colored mixed graphs
Sandip Das, Soumen Nandi, Sagnik Sen
An -colored mixed graph is a graph with its arcs having one of the different colors and edges having one of the different colors. A homomorphism of an $(m,n)…