Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs (Q2515556): Difference between revisions

@@ Property / cites work @@
+Exponential families of non-isomorphic triangulations of complete graphs
+Normal rank
@@ Property / cites work @@
+A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
+Normal rank
@@ Property / cites work @@
+On biembeddings of Latin squares
@@ Property / cites work: On biembeddings of Latin squares / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive constructions for triangulations
@@ Property / cites work: Recursive constructions for triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the number of orientable triangular embeddings of some complete graphs
+Normal rank
@@ Property / cites work @@
+On the number of triangular embeddings of complete graphs and complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+Dihedral biembeddings and triangulations by complete and complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+Q4773723
@@ Property / cites work: Q4773723 / rank @@
+Normal rank