On chromatic number of colored mixed graphs

Sandip Das, Soumen Nandi, Sagnik Sen

An $(m,n)$-colored mixed graph $G$ is a graph with its arcs having one of the $m$ different colors and edges having one of the $n$ different colors. A homomorphism $f$ of an $(m,n)…