On the number of genus embeddings of complete bipartite graphs
From MaRDI portal
Publication:2637736
DOI10.1007/s00373-012-1227-2zbMath1282.05036MaRDI QIDQ2637736
Zhiguo Li, Yanpei Liu, Zeling Shao
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1227-2
05C05: Trees
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Cites Work
- Unnamed Item
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- A sequence representation for maps
- Orientable and non orientable genus of the complete bipartite graph
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. I: Metacyclic case
- Regular embeddings of \(K_{n,n}\) where \(n\) is an odd prime power
- Das Geschlecht des vollständigen paaren Graphen
- The graph genus problem is NP-complete