16 citations · 97 across the 26 of their papers we have counts for
19 papers · 1 filter
On the minimum number of arcs in -dicritical oriented graphs
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
The dichromatic number of a digraph is the minimum number of colours needed to colour the vertices of a digraph such that each colour class induces an acyclic subdig…
On the minimum number of inversions to make a digraph -(arc-)strong
Julien Duron, Frédéric Havet, Florian Hörsch +1
The {\it inversion} of a set of vertices in a digraph consists of reversing the direction of all arcs of . We study (resp. ) whic…
Problems, proofs, and disproofs on the inversion number
Guillaume Aubian, Frédéric Havet, Florian Hörsch +4
The {\it inversion} of a set of vertices in a digraph consists in reversing the direction of all arcs of . The {\it inversion number} of an oriented grap…
On the inversion number of oriented graphs
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
Let be an oriented graph. The inversion of a set of vertices in consists in reversing the direction of all arcs with both ends in . The inversion number of , deno…
On the dichromatic number of surfaces
Pierre Aboulker, Frédéric Havet, Kolja Knauer +1
In this paper, we give bounds on the dichromatic number of a surface , which is the maximum dichromatic number of an oriented graph embeddable on . We determine th…
Powers of paths in tournaments
Nemanja Draganić, François Dross, Jacob Fox +7
In this short note we prove that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…