Minimum genus embeddings of the complete graph (Q335320): Difference between revisions

@@ Property / DOI @@
-.1007/s10114-016-5425-3
@@ Property / DOI: 10.1007/s10114-016-5425-3 / rank @@
-Normal rank
@@ Property / author @@
-Zhao-xiang Li
@@ Property / author: Zhao-xiang Li / rank @@
-Normal rank
@@ Property / author @@
+Zhao-xiang Li
@@ Property / author: Zhao-xiang Li / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 05C30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6646842
@@ Property / zbMATH DE Number: 6646842 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum genus embedding
@@ Property / zbMATH Keywords: maximum genus embedding / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum genus embedding
@@ Property / zbMATH Keywords: minimum genus embedding / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complete graph
@@ Property / zbMATH Keywords: complete graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+current graph
@@ Property / zbMATH Keywords: current graph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-016-5425-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2519890139
@@ Property / OpenAlex ID: W2519890139 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the number of graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Face 2-colourable triangular embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+Exponential families of non-isomorphic triangulations of complete graphs
+Normal rank
@@ Property / cites work @@
+Triangular embeddings of complete graphs from graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+On the number of nonisomorphic orientable regular embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
+Normal rank
@@ Property / cites work @@
+An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
+Normal rank
@@ Property / cites work @@
+Three nonisomorphic triangulations of an orientable surface with the same complete graph
+Normal rank
@@ Property / cites work @@
+Q3937426
@@ Property / cites work: Q3937426 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4716822
@@ Property / cites work: Q4716822 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponentially many maximum genus embeddings and genus embeddings for complete graphs
+Normal rank
@@ Property / cites work @@
+Q4773723
@@ Property / cites work: Q4773723 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum genus of graphs of diameter two
@@ Property / cites work: The maximum genus of graphs of diameter two / rank @@
+Normal rank
@@ Property / cites work @@
+How to determine the maximum genus of a graph
@@ Property / cites work: How to determine the maximum genus of a graph / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10114-016-5425-3
@@ Property / DOI: 10.1007/S10114-016-5425-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:335320