If G has a cut edge, between heavy vertices, there are two graphs G 1 and G 2 with strictly fewer heavy vertices, obtained by removing the cut edge and replacing the loose ends by vertices of degree 1. This process is easily reverted by a single cut-and-join crossover, requiring only G 1 , G 2 in the population.