1. Acyclic coloring of graphs;Alon;Random Structures Algorithms,1991
2. Acyclic edge colorings of graphs;Alon;J. Graph Theory,2001
3. An improvement of the Lovász local lemma via cluster expansion;Bissacot;Combin. Probab. Comput.,2011
4. Combinatorics and asymptotics on trees;Drmota;Cubo J.,2004
5. V. Dujmović, G. Joret, J. Kozik, D.R. Wood, Nonrepetitive colouring via entropy compression, arXiv:1112.5524, 2012.