Vertex-disjoint directed and undirected cycles in general digraphs

Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni +1

The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the followin…