3 papers
math.CO2026
Orthogonality between acyclic subdigraphs and paths in digraphs
Caroline A. de Paula Silva, Cândida Nunes da Silva, Orlando Lee
Let be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) of and a vertex subset (or subdigraph) of ar…
math.CO2026
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 -…
math.CO2025
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…