Classification of nonorientable regular embeddings of complete bipartite graphs
From MaRDI portal
Publication:536644
DOI10.1016/j.jctb.2011.03.003zbMath1226.05100arXiv1001.2936MaRDI QIDQ536644
Publication date: 19 May 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.2936
05C10: Planar graphs; geometric and topological aspects of graph theory
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Classification of Regular Embeddings of Complete Multipartite Graphs, On the orientable regular embeddings of complete multipartite graphs, Classification of nonorientable regular embeddings of Hamming graphs, Nonorientable regular embeddings of graphs of order \(pq\), On the orientably-regular embeddings of graphs of order prime-cube, Nonorientable regular embeddings of graphs of order \(p^{2}\), Bipartite graph embeddings, Riemann surfaces and Galois groups, Classification of nonorientable regular embeddings of Cartesian products of graphs, A classification of orientably-regular embeddings of complete multipartite graphs, Orientably-regular embeddings of a class of multipartite graphs
Cites Work
- Unnamed Item
- Classification of regular embeddings of \(n\)-dimensional cubes
- Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. II: The non-metacyclic case
- Nonexistence of nonorientable regular embeddings of \(n\)-dimensional cubes
- Regular orientable imbeddings of complete graphs
- Cantankerous maps and rotary embeddings of \(K_ n\)
- Regular embeddings of complete bipartite 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
- Complete bipartite graphs with a unique regular embedding
- Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs
- Regular embeddings of complete bipartite graphs: classification and enumeration
- Characterisation of Graphs which Underlie Regular Maps on Closed Surfaces
- Regular orientable embeddings of complete bipartite graphs