Xiangzhou Liu

Feedback vertex sets of digraphs with bounded maximum degree

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$ makes it acyclic. Let $D$ be a digraph with...