24 citations · 100 across the 34 of their papers we have counts for
4 papers · 1 filter
Extension of Gyarfas-Sumner conjecture to digraphs
Pierre Aboulker, Pierre Charbit, Reza Naserasr
The dichromatic number of a digraph is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generaliz…
On the tree-width of even-hole-free graphs
Pierre Aboulker, Isolde Adler, Eun Jung Kim +2
The class of all even-hole-free graphs has unbounded tree-width, as it contains all complete graphs. Recently, a class of (even-hole, )-free graphs was constructed, that still…
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property
Pierre Aboulker, Laurent Beaudou, Martín Matamala +1
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chvátal conjectured in 2008 that a similar result can be achieved in the broa…
Grundy Coloring & friends, Half-Graphs, Bicliques
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim +1
The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order , the smallest available color. The problem Grundy Coloring asks how many colors…