R. Bubley, M. E. Dyer, and C. , Beating the 2? bound for approximately counting colorings: A computer-assisted proof of rapid mixing, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98)

C. Cooper, M. E. Dyer, and A. M. Frieze, On Markov Chains for Randomly H-Coloring a Graph, Journal of Algorithms, vol.39, issue.1, pp.117-134, 2001.
DOI : 10.1006/jagm.2000.1142

M. E. Dyer and A. M. Frieze, Randomly colouring graphs with lower bounds on girth and maximum degree, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.579-587
DOI : 10.1109/SFCS.2001.959934

M. E. Dyer, A. M. Frieze, and M. R. Jerrum, On counting independent sets in sparse graphs, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS'99)

M. E. Dyer and C. , A more rapidly mixing Markov chain for graph colorings, Random Structures and Algorithms, vol.13, issue.3-4, pp.285-317, 1998.
DOI : 10.1002/(SICI)1098-2418(199810/12)13:3/4<285::AID-RSA6>3.0.CO;2-R

P. Thomas and . Hayes, Randomly Coloring Graphs of Girth at least Five, Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC'03)

P. Thomas, E. Hayes, and . Vigoda, A Non-Markovian Coupling for Randomly Sampling Coloring, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS'03)

M. R. Jerrum, A very simple algorithm for estimating the number of k-colorings of a low-degree graph, Random Structures & Algorithms, vol.71, issue.2, 1995.
DOI : 10.1002/rsa.3240070205

M. R. Jerrum and A. Sinclair, The Markov chain Monte Carlo method : an approach to approximate counting and integration, Approximation Algorithms for NP-hard Problems, D. Hochbaum, pp.482-520, 1996.

T. Luczak and E. Vigoda, Torpid mixing of the Wang-Swendsen-Kotecky algorithm for sampling colorings

M. Molloy, The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC'02), pp.91-98
DOI : 10.1137/S0097539702401786

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

J. Salas and A. D. Sokal, Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem, Journal of Statistical Physics, vol.7, issue.Suppl., pp.3-4551, 1997.
DOI : 10.1007/BF02199113

A. J. Sinclair, Randomized Algorithms for Counting and Generating Combinatorial Structures, 1988.

A. J. Sinclair and M. R. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation, vol.82, issue.1, pp.93-133, 1989.
DOI : 10.1016/0890-5401(89)90067-9

E. Vigoda, Improved bounds for sampling colorings, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS'99), pp.1555-1569, 2000.
DOI : 10.1063/1.533196