research
∙
03/21/2023
On the minimum number of inversions to make a digraph k-(arc-)strong
The inversion of a set X of vertices in a digraph D consists of reversin...
share
research
∙
01/27/2023
Decompositions into two linear forests of bounded lengths
For some k ∈ℤ_≥ 0∪∞, we call a linear forest k-bounded if each of its co...
research
∙
12/18/2022
