Large planar $(n,m)$-cliques

An $(n,m)\mathit{\text{-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 $(n,m)\mathit{\text{-complete}}\mathit{\text{graph}}$ $G$ is an $(n,m)$-graph without loops or multiple edges in its underlying graph such that identifying any pair of vertices results in a loop or parallel adjacencies with distinct labels. We show that a planar $(n,m)$-complete graph cannot have more than $3(2n+m{)}^2+(2n+m)+1$ vertices, for all $(n,m)\mathrm{\ne }(0,1)$ and that the bound is tight. This positively settles a conjecture by Bensmail $\mathit{\text{et}}\mathit{\text{al.}}$~[Graphs and Combinatorics 2017].