A minimum-vertex triangulation (Q1219296): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(78)90043-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1995914090
@@ Property / OpenAlex ID: W1995914090 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
+Normal rank
@@ Property / cites work @@
+Q4773723
@@ Property / cites work: Q4773723 / 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 @@
+Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
+Normal rank