Complexity of unique list colorability (Q935144): Difference between revisions

@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971264
@@ Property / cites work: Q3971264 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842715
@@ Property / cites work: Q4842715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3147263
@@ Property / cites work: Q3147263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5460903
@@ Property / cites work: Q5460903 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planar graph choosability
@@ Property / cites work: The complexity of planar graph choosability / rank @@
+Normal rank
@@ Property / cites work @@
+Q2761069
@@ Property / cites work: Q2761069 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ Property / cites work @@
+Q3115277
@@ Property / cites work: Q3115277 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank