1 citations · 1 across the 4 of their papers we have counts for
4 papers
On cuts of small chromatic number in sparse graphs
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf +2
For a given integer , let denote the supremum such that every sufficiently large graph with average degree less than admits a separator $X \subseteq…
Computing the clique number of tournaments
Guillaume Aubian
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing…
Colouring Digraphs
Guillaume Aubian
The aim of this thesis is to investigate how the structure of a digraph affects its dichromatic number and to extend various results on undirected colouring to digraphs. In the fir…
(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…