24 citations · 100 across the 34 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DM2021
Four proofs of the directed Brooks' Theorem
Pierre Aboulker, Guillaume Aubian
We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
math.CO2021★ 1 cited
Decomposing and colouring some locally semicomplete digraphs
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a…
math.CO2021
On the dichromatic number of surfaces
Pierre Aboulker, Frédéric Havet, Kolja Knauer +1
In this paper, we give bounds on the dichromatic number of a surface , which is the maximum dichromatic number of an oriented graph embeddable on . We determine th…