Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration wi...
Main Author: | Jones, Gareth (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2010-02-07.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Biclique: an R package for maximal biclique enumeration in bipartite graphs
by: Yuping Lu, et al.
Published: (2020-02-01) -
The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth
by: Rocha, Mário
Published: (2003) -
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
by: S. El-Serafi, et al.
Published: (2015-06-01) -
The complete bipartite decompositions of graphs
by: Chang Dan Yewn, et al.
Published: (1994) -
The complete bipartite decomposition of crowns
by: Po-Ya Shih, et al.
Published: (1995)