Width Parameterizations for Knot-free Vertex Deletion on Digraphs

Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro +2

A knot in a directed graph $G$ is a strongly connected subgraph $Q$ of $G$ with at least two vertices, such that no vertex in $V(Q)$ is an in-neighbor of a vertex in $V(G)\setminus…