A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
[article]

2021
*
arXiv
*
pre-print

In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property P. Typically, the modification operation ⊠ may be vertex removal, edge removal, edge contraction, or edge addition and the question is, given a graph G and an integer k, whether it is possible to transform G to a graph in P after applying k times the operation ⊠ on G. This problem has been extensively studied for particilar instantiations of ⊠ and P. In this paper we consider the

arXiv:2106.03425v1
fatcat:2s3e7ngkonf4dfoumq64rte524