Chromatic number of signed graphs with bounded maximum degree

Sandip Das, Soumen Nandi, Soumyajit Paul +1

A signed graph $(G,\Sigma )$ is a graph positive and negative ($\Sigma$ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $(G,\Sigma )$ is to switch the signs of the…