Graphical log-linear model search is usually performed by using stepwise procedures in which edges are sequentially added or eliminated from the independence graph. In this paper we implement the search procedure as a genetic algorithm and propose a crossover operator which operates on subgraphs. In a simulation study the proposed procedure is shown to perform better than an automatic backward elimination procedure at the cost of a small increase of computational time.