Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3917502
@@ Property / cites work: Q3917502 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783597
@@ Property / cites work: Q3783597 / rank @@
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684139
@@ Property / cites work: Q3684139 / rank @@
+Normal rank
@@ Property / cites work @@
+NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
+Normal rank
@@ Property / cites work @@
+Über eine Eigenschaft der ebenen Komplexe
@@ Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank @@
+Normal rank
@@ Property / cites work @@
+Bemerkungen zu Hadwigers Vermutung
@@ Property / cites work: Bemerkungen zu Hadwigers Vermutung / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
+Normal rank