2 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Guanghua Dong, Han Ren, Ning Wang +1
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…