BELLITTO , Thomas

The dichromatic number ⃗ χ(D) of a digraph D is the least integer k such that D can be partitioned into k directed acyclic digraphs. A digraph is k-dicritical if ⃗ χ(D) = k and each proper subgraph D ′ of D satisfies ⃗ χ(D) ≤ k − 1. An oriented graph is a digraph with no directed cycle of length 2. For integers k and n, we denote by o k (n) the...

The dichromatic number $\vec{\chi }(D)$ of a digraph $D$ is the least integer $k$ such that $D$ can be partitioned into $k$ directed acyclic digraphs. A digraph is $k$-dicritical if $\vec{\chi }(D) = k$ and each proper subgraph $D^{\prime }$ of $D$ satisfies $\vec{\chi }(D^{\prime }) \leq k-1$. An oriented graph is a digraph with no directed...