The dichromatic number χ⃗(D) of a digraph D is the minimum size of
a par...
The inversion of a set X of vertices in a digraph D consists in
reversin...
The dichromatic number of an oriented graph is the minimum size of a
par...
The dichromatic number of a digraph is the minimum size of a partition o...
We characterize all digraphs H such that orientations of chordal graphs
...
We call a multigraph (k,d)-edge colourable if its edge set can be
partit...
We give four new proofs of the directed version of Brook's Theorem and a...