The complete bipartite graphs which have exactly two orientably edge-transitive embeddings

DOI10.26493/1855-3974.1900.cc1zbMath1486.05065OpenAlexW3034879485MaRDI QIDQ4988858

Wenwen Fan, Xue Yu, Ben Gong Lou

Publication date: 19 May 2021

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1900.cc1

zbMATH Keywords

bipartite graphsedge-transitive embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Symmetric groups (20B30) Primitive groups (20B15)

Related Items (3)

Complete circular regular dessins of type \(\{2^e,2^f\}\). I: metacyclic case ⋮ Complete bipartite multi-graphs with a unique regular dessin ⋮ The edge-regular complete maps

Cites Work

• Unnamed Item
• Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. II: The non-metacyclic case
• Complete regular dessins of odd prime power order
• A classification of orientably edge-transitive circular embeddings of \(\mathbf{K}_{p^e, p^f}\)
• Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. I: Metacyclic case
• Edge-transitive uniface embeddings of bipartite multi-graphs
• Complete bipartite graphs with a unique regular embedding
• ON THE SUPERSOLVABILITY OF BICYCLIC GROUPS
• Regular embeddings of complete bipartite graphs: classification and enumeration
• Characterisation of Graphs which Underlie Regular Maps on Closed Surfaces
• Locally finite, planar, edge-transitive graphs
• The complete bipartite graphs with a unique edge‐transitive embedding

This page was built for publication: The complete bipartite graphs which have exactly two orientably edge-transitive embeddings