Finding paths between 3-colorings (Q2998926): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20514
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20514 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2097520314
@@ Property / OpenAlex ID: W2097520314 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Mixing 3-colourings in bipartite graphs
@@ Property / cites work: Mixing 3-colourings in bipartite graphs / 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 @@
+A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
+Normal rank