scientific article
From MaRDI portal
Publication:3447279
zbMath1117.60070MaRDI QIDQ3447279
Publication date: 28 June 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Coloring of graphs and hypergraphs (05C15)
Related Items
Recoloring Planar Graphs of Girth at Least Five, Randomly coloring simple hypergraphs with fewer colors, A polynomial version of Cereceda's conjecture, Algorithms to approximately count and sample conforming colorings of graphs, List-recoloring of sparse graphs, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data, What can be sampled locally?, Randomly coloring simple hypergraphs, Unnamed Item, Some Problems on Approximate Counting in Graphs and Matroids, The mathematics of mixing things up, Reconfiguration of Spanning Trees with Many or Few Leaves, Recoloring graphs of treewidth 2, Unnamed Item, Frozen colourings of bounded degree graphs, Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$, Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
