Strong mathematical results on the convergence of GA require reachability together with non-trival assumptions on the selection procedure, and so far have become available only for strings . It will be interesting to explore whether cut-and-join crossover on graphs behaves similarly. This endeavor goes beyond the scope of the present contribution, however.