Connectedness of the graph of vertex-colourings

A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

Mark Jerrum · Random Structures and Algorithms · 1995 · 296 citations

Natural Sciences, Computer Science, Mathematics +12

Improved bounds for sampling colorings

Eric Vigoda · Journal of Mathematical Physics · 2000 · 217 citations

Natural Sciences, Computer Science, Mathematics +13

Randomly coloring sparse random graphs with fewer colors than the maximum degree

Martin Dyer, Abraham D. Flaxman, Alan Frieze et al. · Random Structures and Algorithms · 2006 · 53 citations

Natural Sciences, Computer Science, Algorithms +15

Torpid mixing of the Wang–Swendsen–Kotecký algorithm for sampling colorings

Tomasz Łuczak, Eric Vigoda · Journal of Discrete Algorithms · 2004 · 12 citations

Natural Sciences, Chemistry, Computational Physics +4