16 citations · 97 across the 26 of their papers we have counts for
32 papers
Colouring the interference digraph of a set of requests in a bidirected tree
Hugo Boulier, David Coudert, Frédéric Havet +1
In this paper, we investigate the impact of the broadcast effect arising in filterless optical networks on the computational complexity of the wavelength assignment problem. We mod…
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…
Digraph redicolouring
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse +2
Given two -dicolourings of a digraph , we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while…
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…