1. E. Esyp, I. Kazachkov, and V. Remeslennikov, “Divisibility theory and complexity of algorithms for free partially commutative groups,” in Groups, Languages, Algorithms, Contemp. Math., 378, Am. Math. Soc., Providence, RI (2005), pp. 319–348.
2. R. Charney, “An introduction to right-angled Artin groups,” Geom. Dedic., 125, No. 1, 141–158 (2007); http://arxiv.org/abs/math/0610668v1 .
3. A. Duncan, I. V. Kazachkov, and V. N. Remeslennikov, “Automorphisms of partially commutative groups. I: Linear subgroups,” arXiv:math/0803.2213v1.
4. R. Charney, J. Crisp, and K. Vogtmann, “Automorphisms of two-dimensional right-angled Artin groups,” Geom. Topol., 11, 2227–2264 (2007); http://arxiv.org/abs/math/0610980v2 .
5. M. R. Laurence, “A generating set for the automorphism group of a graph group,” J. London Math. Soc., II. Ser., 52, No. 2, 318–334 (1995).