3 citations · 7 across the 15 of their papers we have counts for
Showing 2021Show all
2 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…