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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(91)90081-c
+Normal rank
@@ Property / OpenAlex ID @@
+W2087358907
@@ Property / OpenAlex ID: W2087358907 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:805625