Article ID Journal Published Year Pages File Type
4649031 Discrete Mathematics 2010 6 Pages PDF
Abstract

We prove that for every n,m≥6n,m≥6, the complete bipartite graph Kn,mKn,m has at least 18nm2⌊(n−1)/3⌋⌊(m−2)/4⌋ nonisomorphic orientable as well as nonorientable genus embeddings.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Exponentially many nonisomorphic genus embeddings of Kn,mKn,m
Authors
,