1 citations · 1 across the 4 of their papers we have counts for
7 papers
On the -inversion diameter of oriented graphs
Frédéric Havet, Clément Rambaud, Caroline Silva
In an oriented graph , the {\it inversion} of a subset of vertices consists in reversing the orientation of all arcs with both endvertices in . The {\it -…
Making an oriented graph acyclic using inversions of bounded or prescribed size
Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch +3
Given an oriented graph , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endpoints in . When the subset is of size…
Blow-ups and extensions of trees in tournaments
Pierre Aboulker, Frédéric Havet, William Lochet +3
A class of acyclic digraphs is linearly unavoidable if there exists a constant such that every digraph is contained in all tournaments of order…
Diameter of the inversion graph
Frédéric Havet, Florian Hörsch, Clément Rambaud
In an oriented graph , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endvertices in . The inversion graph of a l…
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
Pierre Aboulker, Frédéric Havet, François Pirot +1
Let be a digraph. Its acyclic number is the maximum order of an acyclic induced subdigraph and its dichromatic number is the least integer such that $…
The 3-dicritical semi-complete digraphs
Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta
A digraph is -dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that…