M. O. Albertson and D. M. Berman, The acyclic chromatic number, Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory and Computing, pp.51-60, 1976.

N. Alon, C. Mcdiarmid, and B. Reed, Acyclic coloring of graphs, Random Structures Algorithms, pp.277-288, 1991.

P. Erd?s and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and finite sets (Colloq, pp.609-627, 1973.

L. Esperet and A. Parreau, Acyclic edge-coloring using entropy compression, European Journal of Combinatorics, vol.34, issue.6, pp.1019-1027, 2013.
DOI : 10.1016/j.ejc.2013.02.007
URL : https://hal.archives-ouvertes.fr/hal-00843770

L. Fortnow, A Kolmogorov Complexity Proof of the Lovász Local Lemma, 2009.

B. Grünbaum, Acyclic colorings of planar graphs, Israel Journal of Mathematics, vol.58, issue.2, pp.390-408, 1973.
DOI : 10.1007/BF02764716

J. Grytczuk, J. Kozik, and P. Micek, New approach to nonrepetitive sequences, Random Structures Algorithms, pp.214-225, 2013.

T. Kulich and M. Keme?ová, On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lov??sz Local Lemma, Information Processing Letters, vol.111, issue.9, pp.436-439, 2011.
DOI : 10.1016/j.ipl.2011.01.013

R. A. Moser, A constructive proof of the Lov??sz local lemma, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.343-350, 2009.
DOI : 10.1145/1536414.1536462

R. A. Moser and G. Tardos, A constructive proof of the general lov??sz local lemma, Journal of the ACM, vol.57, issue.2, pp.1-11, 2010.
DOI : 10.1145/1667053.1667060

P. Ochem and A. Pinlou, Application of entropy compression in pattern avoidance, ArXiv e-prints, 1301, p.1873, 2013.

J. Przyby?o, On the facial Thue choice index via entropy compression, ArXiv e-prints, p.964, 2012.

J. Przyby?o, J. Schreyer, and E. ?krabu?áková, On the facial Thue choice number of plane graphs via entropy compression method, ArXiv e-prints, 1308, p.5128, 2013.

P. Schweitzer, Using the incompressibility method to obtain local lemma results for Ramsey-type problems, Information Processing Letters, vol.109, issue.4, pp.229-232, 2009.
DOI : 10.1016/j.ipl.2008.09.030