Khemmani V.; Lumduanhom C.; Muangloy S.; Muanphet M.; Tipnuch K.
(2016)
For a graph G of size m ≥ 1 and edge-induced subgraphs F and H of size k where 1 ≤ k ≤ m, the subgraph H is said to be obtained from the subgraph F by an edge jump if there exist four distinct vertices u, v, w and x such ...