Finally, we note that every cut-and-join crossover deriving from a 2-cut is reversible in following sense: ) and H = (W, F ) be connected graphs and A = C(V ′ , V ′′ ) and B = C(W ′ , W ′′ ) be inclusion-minimal cuts in G and H, respectively, with |A| = |B|, and consider the joins