We examine the connection of two graph parameters, the size of a minimum feedback arcs
set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs …

A minimum feedback arc set of a digraph D is a minimum set of arcs which removal leaves
the resultant graph free of directed cycles; its cardinality is denoted by τ 1 (D). The acyclic …

For k≥ 2, a strongly connected digraph D is called λ k′-connected if it contains a set of arcs
W such that D− W contains at least k non-trivial strong components. The k-restricted arc …

The acyclic disconnection ω→(D) of a digraph D is the maximum possible number of
(weakly) connected components of a digraph obtained from D by deleting an acyclic set of …

We examine the connection of two graph parameters, the size of a minimum feedback arcs
set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs …

The acyclic disconnection of a digraph is the maximum number of colors such that there is a
vertex-coloring of our digraph with such number of colors with no well-colored cycles. In …