  In this paper, we provide an method to obtain the lower bound on the number
of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n
be an odd number), which, in some sense, improves the results of S. Stahl and
H. Ren.

Combinatorics