9 citations · 15 across the 23 of their papers we have counts for
4 papers · 1 filter
On oriented cliques with respect to push operation
Julien Bensmail, Soumen Nandi, Sagnik Sen
To push a vertex of a directed graph is to change the orientations of all the arcs incident with . An oriented graph is a directed graph without any cyc…
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)…
On homomorphism of oriented graphs with respect to push operation
Sagnik Sen
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex.…
Walk-powers and homomorphism bound of planar graphs
Reza Naserasr, Sagnik Sen, Qiang Sun
As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, .…