Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Natural Self-Reducible Sets
@@ Property / cites work: Natural Self-Reducible Sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Tutte Invariants for Planar Graphs
+Normal rank