Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments (Q3652537): Difference between revisions

@@ Property / cites work @@
+A note on the number of graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Exponential families of non-isomorphic triangulations of complete graphs
+Normal rank
@@ Property / cites work @@
+Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
+Normal rank
@@ Property / cites work @@
+Triangular embeddings of complete graphs from graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Another proof of the map color theorem for nonorientable surfaces.
+Normal rank
@@ Property / cites work @@
+On the number of nonisomorphic orientable regular embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
+Normal rank