research
∙
06/19/2023
On the minimum number of arcs in 4-dicritical oriented graphs
The dichromatic number χ⃗(D) of a digraph D is the minimum number of col...
share
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...
research
∙
01/09/2023
Digraph redicolouring
Given two k-dicolourings of a digraph D, we prove that it is PSPACE-comp...
research
∙
12/18/2022
Problems, proofs, and disproofs on the inversion number
The inversion of a set X of vertices in a digraph D consists in reversin...
research
∙
07/03/2022
On the minimum number of arcs in k-dicritical oriented graphs
The dichromatic number (D) of a digraph D is the least integer k such th...
research
∙
05/10/2021
On the inversion number of oriented graphs
Let D be an oriented graph. The inversion of a set X of vertices in D co...
research
∙
02/01/2021
On the dichromatic number of surfaces
In this paper, we give bounds on the dichromatic number χ⃗(Σ) of a surfa...
research
∙
05/27/2019
Spanning eulerian subdigraphs in semicomplete digraphs
A digraph is eulerian if it is connected and every vertex has its in-deg...
research
∙
12/12/2018