Analogous to cliques for (m,n)-colored mixed graphs

Julien Bensmail, Christopher Duffy, Sagnik Sen

Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $…