Heuristic for rapidly four-coloring large planar graphs (Q1180542): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+A digest of the four color theorem
@@ Property / cites work: A digest of the four color theorem / rank @@
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A linear 5-coloring algorithm of planar graphs
@@ Property / cites work: A linear 5-coloring algorithm of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094885
@@ Property / cites work: Q4094885 / rank @@
+Normal rank
@@ Property / cites work @@
+On linear-time algorithms for five-coloring planar graphs
+Normal rank
@@ Property / cites work @@
+An attempt to understand the four color problem
@@ Property / cites work: An attempt to understand the four color problem / rank @@
+Normal rank
@@ Property / cites work @@
+A graph coloring algorithm for large scheduling problems
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs: Theory and algorithms
@@ Property / cites work: Planar graphs: Theory and algorithms / rank @@
+Normal rank