Regular embeddings of complete bipartite graphs: classification and enumeration
DOI10.1112/plms/pdp061zbMath1202.05028arXiv0911.4340OpenAlexW3102501857MaRDI QIDQ3589234
Publication date: 20 September 2010
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4340
classificationfinite solvable groupsautomorphism groupregular mapsenumerationcomplete bipartite graphsregular embeddingfactorisable groups
Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Solvable groups, supersolvable groups (20F16) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (35)
This page was built for publication: Regular embeddings of complete bipartite graphs: classification and enumeration