The acyclic disconnection of a digraph D is the maximum number of components that can be
obtained by deleting from D the set of arcs of an acyclic subdigraph. We give bounds for the …

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 disprove the following conjecture due to Víctor Neumann-Lara: for every pair $(r, s) $ of
integers such that $ r\geq s\geq 2$, there is an infinite set of circulant tournaments $ T $ such …

The acyclic disconnection, ω ⃗ (D), of a digraph D is the maximum number of connected
components of the underlying graph of D− A (D∗), where D∗ is an acyclic subdigraph of D …

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 …

The\textit {acyclic disconnection} $\overrightarrow {\omega}(D) $(resp. the\textit {directed
triangle free disconnection} $\overrightarrow {\omega} _ {3}(D) $) of a digraph $ D $ is …

The acyclic disconnection ω ⃗ (D) of a digraph D is defined as the maximum number of
colors in a coloring of the vertices of D such that no cycle is properly colored (in a proper …

The concept of molds, introduced by the authors in a recent preprint, break regular
tournaments naturally into big classes: cyclic tournaments, tame tournaments and wild …

I will present results on tight regular tournaments using the structure of its domination
digraph. The domination graph of a tournament T is the graph on the vertex set V (T) with …

We disprove the following conjecture due to Víctor Neumann-Lara: for every couple of
integers (r, s) such that r≥ s≥ 2 there is an infinite set of circulant tournaments T such that …