Constructive generation of very hard 3-colorability instances (Q2467358): Difference between revisions

@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / 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 @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Frozen development in graph coloring
@@ Property / cites work: Frozen development in graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of 4-Coloring a 3-Colorable Graph
@@ Property / cites work: On the Hardness of 4-Coloring a 3-Colorable Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3754634
@@ Property / cites work: Q3754634 / rank @@
+Normal rank
@@ Property / cites work @@
+Local optima topology for the \(k\)-coloring problem
+Normal rank
@@ Property / cites work @@
+The hardest constraint problems: A double phase transition
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4386968
@@ Property / cites work: Q4386968 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting the deep structure of constraint problems
+Normal rank