1 citations · 2 across the 5 of their papers we have counts for
11 papers
Heroes in orientations of chordal graphs
Pierre Aboulker, Guillaume Aubian, Raphael Steiner
We characterize all digraphs such that orientations of chordal graphs with no induced copy of have bounded dichromatic number.
Vizing's and Shannon's Theorems for defective edge colouring
Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang
We call a multigraph -edge colourable if its edge set can be partitioned into subgraphs of maximum degree at most and denote as the minimum such that…
Chordal directed graphs are not -bounded
Pierre Aboulker, Nicolas Bousquet, Rémi de Verclos
We show that digraphs with no transitive tournament on vertices and in which every induced directed cycle has length can have arbitrarily large dichromatic number. This ans…
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…
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…