Self-dual embeddings of complete bipartite graphs (Q1193565)

It is shown that, in both the orientable and the nonorientable sense, \(K_{n,m}\) has a self-dual imbedding if and only if \(n\) and \(m\) are both even integers exceeding 2, except that \(K_{6,6}\) has no orientable self-dual imbedding. The latter claim was verified by an exhaustive computer search. The requisite constructions for the other cases use a ``cut and paste'' procedure to join two self-dual imbeddings into one larger self-dual imbedding.