Nonorientable genus embedding of nearly complete bipartite graphs

Shengxiang Lv

The nearly complete bipartite graph $G(m,n,k)$ is obtained by removing $k$ independent edges from the complete bipartite graph $K_{m,n}$. In this paper, we prove that for any nearl…