Graphical complexity of products of permutation groups

In this paper we study representations of permutation groups as automorphism groups of colored graphs and supergraphs. In particular, we consider how such representations for various products of permutation groups can be obtained from representations of factors and how the degree of complexity increases in such constructions.