3 citations · 8 across the 25 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022★ 3 cited
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…
cs.DS2022★ 1 cited
On the parameterized complexity of symmetric directed multicut
Eduard Eiben, Clément Rambaud, Magnus Wahlström
We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph , a set of cut requests $C=\{(s_1,t_1),\ldo…
math.CO2022★ 2 cited
On the minimum number of arcs in -dicritical oriented graphs
Pierre Aboulker, Thomas Bellitto, Frédéric Havet +1
The dichromatic number $\dic(D)$ of a digraph is the least integer such that can be partitioned into directed acyclic digraphs. A digraph is -dicritical if $\dic…