  A graph is said to be nearly complete bipartite if it can be obtained by
deleting a set of independent edges from a complete bipartite graph. The
nonorientable genus of such graphs is known except in a few cases where the
sizes of the partite classes differ by at most one, and a maximum matching is
deleted. We resolve these missing cases using three classic tools for
constructing genus embeddings of the complete bipartite graphs: current graphs,
diamond sums, and the direct rotation systems of Ringel.
