24 citations · 104 across the 24 of their papers we have counts for
28 papers
Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number
Pierre Charbit, Samuel Coulomb
In the 1960s, Erdős and Hajnal conjectured that every graph with sufficiently large chromatic number contains a subgraph of large girth (size of a smallest cycle) and large chromat…
Acyclic Dichromatic Number of Tournaments: these are the Champions
Pierre Aboulker, Pierre Charbit, Samuel Coulomb +2
The acyclic dichromatic number of an oriented graph is the minimum size of a vertex-partition such that the digraphs induced by any single part are acyclic, and the oriented bipart…
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
Pierre Charbit, Michel Habib, Amalia Sorondo
An orientation of a given static graph is called transitive if for any three vertices , the presence of arcs and forces the presence of the arc . If o…
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
In its Euclidean form, the Dense Neighborhood Lemma (DNL) asserts that if is a finite set of points of such that for each the ball intersects…
Dichromatic Number and Cycle Inversions
Pierre Charbit, Stéphan Thomassé
The results of this note were stated in the first author PhD manuscript in 2006 but never published. The writing of a proof given there was slightly careless and the proof itself s…
Clique number of tournaments
Pierre Aboulker, Guillaume Aubian, Pierre Charbit +1
Given a digraph together with an ordering of its vertices, the \emph{backedge graph} of with respect to is the undirected graph with the same ve…