1. Barth, D.: Bandwidth and cutwidth of the mesh of d-Ary trees. Euro-Par I, 243–246 (1996)
2. Bretto, A., Faisant, A.: Another way for associating a graph to a group. Math. Slovaca 55(1), 1–8 (2005)
3. Bretto, A., Gilibert, L.: Symmetric and semisymmetric graphs construction using G-graphs. In: Kauers, M. (ed.) International Symposium on Symbolic and Algebraic Computation, (ISSAC’05), pp. 61–67, Beijing, China, 24–27 July. ACM, New York. ISBN:1-59593-095-7 (2005)
4. Bretto, A., Gilibert, L.: G-graphs for the cage problem: a new upper bound. In: International Symposium on Symbolic and Algebraic Computation, (ISSAC’07), Waterloo, Ontario, Canada, 29 July–1 August. ACM, New York. ISBN:978-1-59593-743-8 (2007)
5. Bretto, A., Faisant, A., Gillibert, L.: G-graphs: A new representation of groups. J. Symbolic Comput. 42(5), 549–560 (2007). ISSN:0747-7171