On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters

Sandip Das, Abhiruk Lahiri, Soumen Nandi +2

An $(n,m)$-graph is characterised by having $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n,m)$-graph $G$ to an $(n,m)$-graph $H$, is a vertex mapping that prese…