Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

An Enumeration Of Minimum Genus Orientable Embeddings of Some Complete Bipartite Graphs.

M.J. Grannell1, M. Knor2
1Department of Mathematics and Statistics The Open University Walton Hall, Milton Keynes MK7 6AA UNITED KINGDOM
2Department of Mathematics, Faculty of Civil Engineering Slovak University of Technology Radlinského 11, 813 68 Bratislava SLOVAKIA
  • Published: 31/05/2010

Abstract

We enumerate nonisomorphic minimum genus orientable embeddings of the complete bipartite graph \( K_{m,n} \) for \( 2 \leq m, n \leq 7 \) except for \( (m, n) = (7, 7) \).

Keywords: Minimum genus embedding, complete bipartite graph
Citation
M.J. Grannell, M. Knor. An Enumeration Of Minimum Genus Orientable Embeddings of Some Complete Bipartite Graphs.[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 073. 95-102. .