Mixing 3-Colourings in Bipartite Graphs (Q3508565): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2987442053
@@ Property / OpenAlex ID: W2987442053 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3324796
@@ Property / cites work: Q3324796 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectedness of the graph of vertex-colourings
@@ Property / cites work: Connectedness of the graph of vertex-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4507228
@@ Property / cites work: Q4507228 / rank @@
+Normal rank
@@ Property / cites work @@
+Random sampling of 3‐colorings in ℤ<sup>2</sup>
+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 @@
+Computational complexity of compaction to irreflexive cycles
+Normal rank