2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2023★ 1 cited
(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…
math.CO2022★ 2 cited
On the minimum number of arcs in -dicritical oriented graphs
Pierre Aboulker, Thomas Bellitto, Frédéric Havet +1
The dichromatic number $\dic(D)$ of a digraph is the least integer such that can be partitioned into directed acyclic digraphs. A digraph is -dicritical if $\dic…
math.CO2016
Subdivisions in digraphs of large out-degree or large dichromatic number
Pierre Aboulker, Nathann Cohen, Fréderic Havet +3
In 1985, Mader conjectured the existence of a function such that every digraph with minimum out-degree at least contains a subdivision of the transitive tournament of or…