Back to Search
Start Over
Lower bound on the number of the maximum genus embedding of $K_{n,n}$
- Publication Year :
- 2012
-
Abstract
- 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.
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1203.0855
- Document Type :
- Working Paper