Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-010-0969-y
@@ Property / DOI: 10.1007/s00373-010-0969-y / 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/s00373-010-0969-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2082110194
@@ Property / OpenAlex ID: W2082110194 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the number of graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Triangular embeddings of complete graphs from graceful labellings of paths
+Normal rank
@@ Property / cites work @@
+Q5421812
@@ Property / cites work: Q5421812 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+A new characterization of the maximum genus of a graph
+Normal rank
@@ Property / cites work @@
+Q4773723
@@ Property / cites work: Q4773723 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of maximum genus embeddings of almost all graphs
+Normal rank
@@ Property / cites work @@
+Region distributions of some small diameter graphs
+Normal rank
@@ Property / cites work @@
+The graph genus problem is NP-complete
@@ Property / cites work: The graph genus problem is NP-complete / 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/S00373-010-0969-Y
@@ Property / DOI: 10.1007/S00373-010-0969-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:659679