Counting and sampling \(H\)-colourings (Q1887143): Difference between revisions

@@ Property / cites work @@
+Gibbs measures and dismantlable graphs
@@ Property / cites work: Gibbs measures and dismantlable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Markov Chains for Randomly H-Coloring a Graph
@@ Property / cites work: On Markov Chains for Randomly H-Coloring a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263659
@@ Property / cites work: Q4263659 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4440428
@@ Property / cites work: Q4440428 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741175
@@ Property / cites work: Q2741175 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of two‐state spin systems
+Normal rank
@@ Property / cites work @@
+The complexity of choosing an             <i>H</i>             -colouring (nearly) uniformly at random
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank