scientific article
From MaRDI portal
Publication:2712575
DOI<101::AID-RSA1000>3.0.CO;2-D 10.1002/1098-2418(200103)18:2<101::AID-RSA1000>3.0.CO;2-DzbMath0972.60076MaRDI QIDQ2712575
No author found.
Publication date: 13 November 2001
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs ⋮ Sampling colourings of the triangular lattice ⋮ Rapid mixing for lattice colourings with fewer colours ⋮ Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice
Cites Work
- Unnamed Item
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Improved bounds for sampling colorings
- A more rapidly mixing Markov chain for graph colorings
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- On Markov Chains for Independent Sets
This page was built for publication: