
Four proofs of the directed Brooks' Theorem
We give four new proofs of the directed version of Brook's Theorem and a...
read it

On the dichromatic number of surfaces
In this paper, we give bounds on the dichromatic number χ⃗(Σ) of a surfa...
read it

Extension of GyarfasSumner conjecture to digraphs
The dichromatic number of a digraph D is the minimum number of colors ne...
read it

On the treewidth of evenholefree graphs
The class of all evenholefree graphs has unbounded treewidth, as it c...
read it

Graphs with no induced house nor induced hole have the de BruijnErdős property
A set of n points in the plane which are not all collinear defines at le...
read it

Grundy Coloring friends, HalfGraphs, Bicliques
The firstfit coloring is a heuristic that assigns to each vertex, arriv...
read it

Extension Complexity of the Correlation Polytope
We prove that for every nvertex graph G, the extension complexity of th...
read it

Distributed coloring in sparse graphs with fewer colors
This paper is concerned with efficiently coloring sparse graphs in the d...
read it

A tight ErdősPósa function for wheel minors
Let W_t denote the wheel on t+1 vertices. We prove that for every intege...
read it
Pierre Aboulker
is this you? claim profile