Block Elimination Distance

by   Öznur Yaşar Diner, et al.

We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class G, the class B( G) contains all graphs whose blocks belong to G and the class A( G) contains all graphs where the removal of a vertex creates a graph in G. Given a hereditary graph class G, we recursively define G^(k) so that G^(0)= B( G) and, if k≥ 1, G^(k)= B( A( G^(k-1))). The block elimination distance of a graph G to a graph class G is the minimum k such that G∈ G^(k) and can be seen as an analog of the elimination distance parameter, with the difference that connectivity is now replaced by biconnectivity. We show that, for every non-trivial hereditary class G, the problem of deciding whether G∈ G^(k) is NP-complete. We focus on the case where G is minor-closed and we study the minor obstruction set of G^(k). We prove that the size of the obstructions of G^(k) is upper bounded by some explicit function of k and the maximum size of a minor obstruction of G. This implies that the problem of deciding whether G∈ G^(k) is constructively fixed parameter tractable, when parameterized by k. Our results are based on a structural characterization of the obstructions of B( G), relatively to the obstructions of G. We give two graph operations that generate members of G^(k) from members of G^(k-1) and we prove that this set of operations is complete for the class O of outerplanar graphs. This yields the identification of all members O∩ G^(k), for every k∈ℕ and every non-trivial minor-closed graph class G.


page 1

page 2

page 3

page 4


Elimination Distance to Topological-minor-free Graphs is FPT

In the literature on parameterized graph problems, there has been an inc...

Elimination distance to bounded degree on planar graphs

We study the graph parameter elimination distance to bounded degree, whi...

k-apices of minor-closed graph classes. I. Bounding the obstructions

Let G be a minor-closed graph class. We say that a graph G is a k-apex o...

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

We study efficient preprocessing for the undirected Feedback Vertex Set ...

All minor-minimal apex obstructions with connectivity two

A graph is an apex graph if it contains a vertex whose deletion leaves a...

O(1) Steiner Point Removal in Series-Parallel Graphs

We study how to vertex-sparsify a graph while preserving both the graph'...

Transforming graph states using single-qubit operations

Stabilizer states form an important class of states in quantum informati...

Please sign up or login with your details

Forgot password? Click here to reset