Contents

Ars Combinatoria

  • Research article

Lower Bound on the Number of the Maximum Genus Embedding of \(K_{n,n}\)

Guanghua Dong1,2, Han Ren3, Ning Wang4, Yuangiu Huang1
1Dept. of Math., Normal University of Hunan, Changsha, 410081, China
2Dept. of Math., Tianjin Polytechnic University, Tianjin, 800887
3Dept. of Math., East China Normal University, Shanghai, 200062, China
4Dept. of Information & Technology, Tianjin University of Finance and Economics, Tianjin, 800222, China
  • Published: 31/01/2013

Abstract

In this paper, we provide a method to obtain the lower bound on the number of distinct maximum genus embeddings of the complete bipartite graph \(K_{n,n}\) (\(n\) is an odd number), which, in some sense, improves the results of S. Stahl and H. Ren.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Guanghua Dong, Han Ren, Ning Wang, Yuangiu Huang. Lower Bound on the Number of the Maximum Genus Embedding of \(K_{n,n}\)[J], Ars Combinatoria, Volume 108. 155-159. .