3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DM2019
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…
math.CO2016★ 3 cited
Chromatic number of signed graphs with bounded maximum degree
Sandip Das, Soumen Nandi, Soumyajit Paul +1
A signed graph is a graph positive and negative ( denotes the set of negative edges). To re-sign a vertex of a signed graph is to switch the signs of the…