On relative clique number of colored mixed graphs

Sandip Das, Soumen Nandi, Debdeep Roy +1

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