Large planar $(n,m)$-cliques

Susobhan Bandopadhyay, Sagnik Sen, S Taruni

An \textit{$(n,m)$-graph} $G$ is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the $n$ (resp., $m$) different symbols. An \textit{$(n,m)$…