Block Elimination Distance

We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class 𝒢 , the class ℬ(𝒢) contains all graphs whose blocks belong to 𝒢 and the class 𝒜(𝒢) contains all graphs where the removal of a vertex creates a graph in 𝒢 . Given a hereditary graph class 𝒢 , we recursively define 𝒢^(k) so that 𝒢^(0)=ℬ(𝒢) and, if k≥ 1 , 𝒢^(k)=ℬ(𝒜(𝒢^(k-1))) . We show that, for every non-trivial hereditary class 𝒢 , the problem of deciding whether G∈𝒢^(k) is NP-complete. We focus on the case where 𝒢 is minor-closed and we study the minor obstruction set of 𝒢^(k) i.e., the minor-minimal graphs not in 𝒢^(k) . We prove that the size of the obstructions of 𝒢^(k) is upper bounded by some explicit function of k and the maximum size of a minor obstruction of 𝒢 . This implies that the problem of deciding whether G∈𝒢^(k) is constructively fixed parameter tractable, when parameterized by k . Finally, we give two graph operations that generate members of 𝒢^(k) from members of 𝒢^(k-1) and we prove that this set of operations is complete for the class 𝒪 of outerplanar graphs.Please check and confirm if the authors Given and Family names have been correctly identified for author znur YaŸar Diner.All authors names have been identified correctly.Please confirm if the corresponding author is correctly identified. Amend if necessary.This is correct