Complete bipartite multi-graphs with a unique regular dessin (Q2240739): Difference between revisions

@@ Property / cites work @@
+Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. I: Metacyclic case
+Normal rank
@@ Property / cites work @@
+Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. II: The non-metacyclic case
+Normal rank
@@ Property / cites work @@
+The complete bipartite graphs with a unique edge‐transitive embedding
+Normal rank
@@ Property / cites work @@
+A classification of orientably edge-transitive circular embeddings of \(\mathbf{K}_{p^e, p^f}\)
+Normal rank
@@ Property / cites work @@
+Edge-transitive uniface embeddings of bipartite multi-graphs
+Normal rank
@@ Property / cites work @@
+Q4364755
@@ Property / cites work: Q4364755 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete regular dessins of odd prime power order
@@ Property / cites work: Complete regular dessins of odd prime power order / rank @@
+Normal rank
@@ Property / cites work @@
+Nilpotent groups of class two which underly a unique regular dessin
+Normal rank
@@ Property / cites work @@
+Regular embeddings of complete bipartite graphs: classification and enumeration
+Normal rank
@@ Property / cites work @@
+Regular embeddings of \(K_{n,n}\) where \(n\) is an odd prime power
+Normal rank
@@ Property / cites work @@
+Complete bipartite graphs with a unique regular embedding
+Normal rank
@@ Property / cites work @@
+Regular orientable embeddings of complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+Regular embeddings of complete bipartite graphs
@@ Property / cites work: Regular embeddings of complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How symmetric can maps on surfaces be?
@@ Property / cites work: How symmetric can maps on surfaces be? / rank @@
+Normal rank
@@ Property / cites work @@
+Realizing finite edge-transitive orientable maps
@@ Property / cites work: Realizing finite edge-transitive orientable maps / rank @@
+Normal rank
@@ Property / cites work @@
+The complete bipartite graphs which have exactly two orientably edge-transitive embeddings
+Normal rank