The following pages link to (Q3447279):
Displayed 18 items.
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- The mathematics of mixing things up (Q644914) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- Randomly coloring simple hypergraphs (Q1944148) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- (Q5009556) (← links)
- (Q5090918) (← links)
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$ (Q5499734) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data (Q6056577) (← links)