(P6, triangle)-free digraphs have bounded dichromatic number

Pierre Aboulker, Guillaume Aubian, Pierre Charbit +1

The dichromatic number of an oriented graph is the minimum size of a partition of its vertices into acyclic induced subdigraphs. We prove that oriented graphs with no induced direc…