11 citations · 12 across the 3 of their papers we have counts for
3 papers
math.CO2024
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…
math.CO2023★ 1 cited
(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…
cs.DM2014★ 11 cited
Graphs with large chromatic number induce -cycles
Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
Answering a question of Kalai and Meshulam, we prove that graphs without induced cycles of length have bounded chromatic number. This implies the very first case of a much bro…