# Block Elimination Distance

@article{Diner2021BlockED, title={Block Elimination Distance}, author={{\"O}znur Yaşar Diner and Archontia C. Giannopoulou and Giannos Stamoulis and Dimitrios M. Thilikos}, journal={Graphs Comb.}, year={2021}, volume={38}, pages={133} }

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 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…

## References

SHOWING 1-10 OF 24 REFERENCES

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

- MathematicsArXiv
- 2021

It is proved that every graph in the obstruction set of Ak(G), i.e., the minor-minimal set of graphs not belonging to Ak (G), has size at most 22 22 poly(k) , where poly is a polynomial function whose degree depends on the size of the major-obstructions of G.

### On the Parameterized Complexity of Clique Elimination Distance

- Mathematics, Computer ScienceIPEC
- 2020

The problem of computing the elimination distance of a given graph to the class of cluster graphs is considered and the study of the parameterized complexity of a more general version – that of obtaining a modulator to such graphs is initiated.

### Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree

- Mathematics, Computer ScienceAlgorithmica
- 2015

It is established that graph canonisation, and thus graph isomorphism, is $$\mathsf {FPT}$$FPT when parameterized by elimination distance to bounded degree, extending results of Bouland et al.

### An FPT Algorithm for Elimination Distance to Bounded Degree Graphs

- MathematicsSTACS
- 2021

This paper answers the question of Bulian and Dawar in the affirmative for general graphs and gives a more general result capturing elimination distance to any graph class characterized by a finite set of graphs as forbidden induced subgraphs.

### Vertex deletion parameterized by elimination distance and even less

- Mathematics, Computer ScienceSTOC
- 2021

A framework for computing approximately optimal decompositions related to these graph measures is presented, and if the cost of an optimal decomposition is k, it is shown how to find a decomposition of cost kO(1) in time f(k) · nO( 1).

### Excluding a Ladder

- MathematicsComb.
- 2022

It is shown that posets whose cover graphs exclude a fixed ladder as a minor have bounded dimension, a new step towards the goal of understanding which graphs are unavoidable as minors in cover graphs of posets with large dimension.

### Elimination distance to bounded degree on planar graphs

- MathematicsMFCS
- 2020

It is proved that the graph parameter elimination distance to bounded degree is fixed-parameter tractable on planar graphs and there exists an algorithm that decides in time whether the elimination distance of G to the class of degree $d$ graphs is at most k.

### The disjoint paths problem in quadratic time

- Mathematics, Computer ScienceJ. Comb. Theory, Ser. B
- 2012

### Improved Bounds for the Flat Wall Theorem

- MathematicsSODA
- 2015

The proof is self-contained, except for using a well-known theorem on routing pairs of disjoint paths, and provides efficient algorithms that return either a model of the Kt-minor, or a vertex set A and a flat wall of size w in G\A.

### Fixed-Parameter Tractable Distances to Sparse Graph Classes

- Mathematics, Computer ScienceAlgorithmica
- 2016

It is shown that for various classes C of sparse graphs, and several measures of distance to such classes, the problem of determining the distance of a given graph G to C is fixed-parameter tractable.