1. Bubley, R., Dyer, M.: Path coupling: a technique for proving rapid mixing in Markov chains. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pp. 223–231 (1997)
2. Dyer, M., Frieze, A.: Randomly colouring graphs with lower bounds on girth and maximum degree. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 579–587 (2001)
3. Dyer, M., Frieze, A., Hayes, T.P., Vigoda, E.: Randomly coloring constant degree graphs. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 582–589 (2004)
4. Dyer, M., Greenhill, C., Molloy, M.: Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Structure and Algorithms 20(1), 98–114 (2002)
5. Frieze, A., Vera, J.: On randomly colouring locally sparse graphs. Discrete Mathematics and Theoretical Computer Science 8(1), 121–128 (2006)