3 papers
math.CO2026
A relaxation of the Bermond-Thomassen conjecture
Stéphane Bessy, Matthijs Muis, Jean-Sébastien Sereni +2
The well-known Bermond-Thomassen conjecture states that every digraph of minimum out-degree at least contains vertex-disjoint directed cycles. Despite being posed in 198…
math.CO2025
Plane Strong Connectivity Augmentation
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald +1
We investigate the problem of strong connectivity augmentation within plane oriented graphs. We show that deciding whether a plane oriented graph can be augmented with (any num…
math.CO2025
Dichromatic number of chordal graphs
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
The dichromatic number of a digraph is the minimum integer such that it admits a -dicolouring, i.e. a partition of its vertices into acyclic subdigraphs. We say that a d…