For two edge-induced subgraphs F and H of the same size in a graph G, the subgraph H can be obtained from F by an edge jump if there exist four distinct vertices u, v, w, and x in G such that uv ~… (More)

A graph H is obtained from a graph G by an edge rotation if G contains three distinct vertices u, v, and w such that uv ∈ E(G), uw 6∈ E(G), and H = G − uv + uw. A graph H is obtained from a graph G… (More)