Genus embeddings of a type of graph (Q949340): Difference between revisions

@@ Property / DOI @@
-.1007/s12190-008-0077-9
@@ Property / DOI: 10.1007/s12190-008-0077-9 / 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/s12190-008-0077-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2078072472
@@ Property / OpenAlex ID: W2078072472 / rank @@
+Normal rank
@@ Property / cites work @@
+Orientable and non orientable genus of the complete bipartite graph
+Normal rank
@@ Property / cites work @@
+Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
+Normal rank
@@ Property / cites work @@
+Q4273160
@@ Property / cites work: Q4273160 / 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 @@
+Das Geschlecht des vollständigen paaren Graphen
@@ Property / cites work: Das Geschlecht des vollständigen paaren Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
@@ Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Genus embeddings for some complete tripartite 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 / DOI @@
+.1007/S12190-008-0077-9
@@ Property / DOI: 10.1007/S12190-008-0077-9 / rank @@
+Normal rank