The acyclic disconnection of a digraph
The author introduces a new invariant of digraphs: the acyclic disconnection of a digraph \(D\) is the minimum number of connected components of the subgraphs obtained from \(D\) by deleting an acyclic set of arcs. Some results are obtained about this invariant, in general, and for circulant tournaments, in particular.
scientific article; zbMATH DE number 1322042