The nonorientable genus of joins of complete graphs with large edgeless graphs (Q2642016)

The authors show that the nonorientable genus of \(\overline{K}_{m}+K_{n}\) is \(\lceil \frac{(m-2)(n-2)}{2}\rceil\) for \(n \geq 3\) and \(m \geq n-1\), \((m,n) \neq (4,5)\). Using this result they calculate the nonorientable genus of \(\overline{K}_{m}+G\) where \(m \geq | V(G)| +1\). The methods are of independent interest in that they involve showing that for \(n \geq 4\), \(n \neq 5\), \(K_{n}\) has a nonorientable embedding in which all facial walks are Hamiltonian cycles and that when \(n\) is odd there is a 2-face-colorable embedding.