We calculate the outerplanar crossing numbers of complete multipartite graphs which have $n$ partite sets with $m$ vertices and one partite set with $p$ vertices, where either $p|mn$ or $mn|p$.
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
Rainbow Connection for Complete Multipartite Graphs
The p-Domination Number of Complete Multipartite Graphs
![QR code for arXiv:math/0605264 [math.CO]](http://oss.arxitics.com/images/favicon.svg)