N. Alon, M. Krivelevich, and B. Sudakov, Coloring Graphs with Sparse Neighborhoods, Journal of Combinatorial Theory, Series B, vol.77, issue.1, pp.73-82, 1999.
DOI : 10.1006/jctb.1999.1910

M. Dyer and A. Frieze, Randomly colouring graphs with lower bounds on girth and maximum degree, Random Structures and Algorithms, pp.167-179, 2003.

M. E. Dyer, A. M. Frieze, and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, Journal of the ACM, vol.38, issue.1, pp.1-17, 1991.
DOI : 10.1145/102782.102783

L. Goldberg, R. Martin, and M. Paterson, Strong Spatial Mixing for Lattice Graphs with Fewer Colours, 45th Annual IEEE Symposium on Foundations of Computer Science
DOI : 10.1109/FOCS.2004.63

T. P. Hayes, Randomly coloring graphs of girth at least five, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.269-278, 2003.
DOI : 10.1145/780542.780584

T. P. Hayes and E. Vigoda, A non-Markovian coupling for randomly sampling colorings, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.618-627, 2003.
DOI : 10.1109/SFCS.2003.1238234

T. P. Hayes and E. Vigoda, Coupling with the stationarity distribution and improved sampling fror colorings and independent sets

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, pp.157-165, 1995.
DOI : 10.1002/rsa.3240070205

M. R. Jerrum, Counting, sampling and integrating: algorithms and complexity, Lectures in Mathematics?ETH Zürich, 2003.
DOI : 10.1007/978-3-0348-8005-3

M. R. Jerrum, A. Sinclair, and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, pp.712-721, 2001.
DOI : 10.1145/380752.380877

M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, vol.43, pp.169-188, 1986.
DOI : 10.1016/0304-3975(86)90174-X

A. Johansson, Asymptotic choice number for triangle-free graphs, DIMACS technical report, 1996.

R. Kannan, L. Lovász, and M. Simonovits, Random walks and anO*(n5) volume algorithm for convex bodies, Random Structures and Algorithms, vol.11, issue.1, pp.1-50, 1997.
DOI : 10.1002/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X

L. Lovász and S. Vempala, Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
DOI : 10.1109/SFCS.2003.1238237

M. Molloy, The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree, SIAM Journal on Computing, vol.33, issue.3
DOI : 10.1137/S0097539702401786

J. Van-den, J. E. Berg, and . Steif, Percolation and the hard-core lattice gas model, Stochastic Processes and their Applications 49, pp.179-197, 1994.
DOI : 10.1016/0304-4149(94)90132-5

E. Vigoda, Improved bounds for sampling colorings, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp.51-59, 1999.

V. Vu, A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs, Combinatorics, Probability and Computing, vol.11, issue.01, pp.103-111, 2002.
DOI : 10.1017/S0963548301004898