Guthrie's problem: new equivalences and rapid reductions (Q672855): 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
@@ Property / cites work: Every planar map is four colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Problems on pairs of trees and the four colour problem of planar graphs
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / 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 @@
+Q4230328
@@ Property / cites work: Q4230328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912613
@@ Property / cites work: Q3912613 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank