research
∙
10/18/2022
The smallest 5-chromatic tournament
A coloring of a digraph is a partition of its vertex set such that each ...
share
research
∙
08/23/2022
Homomorphically Full Oriented Graphs
Homomorphically full graphs are those for which every homomorphic image ...
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
∙
09/07/2021
Locating Dominating Sets in local tournaments
A dominating set in a directed graph is a set of vertices S such that al...
research
∙
06/30/2021
Close relatives (of Feedback Vertex Set), revisited
At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a numb...
research
∙
09/27/2020
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
The notion of forbidden-transition graphs allows for a robust generaliza...
research
∙
07/01/2019
The directed 2-linkage problem with length constraints
The weak 2-linkage problem for digraphs asks for a given digraph and ve...
research
∙
06/30/2019
Connecting edge-colouring
This paper studies the problem of connecting edge-colouring. Given an un...
research
∙
10/01/2018
On the density of sets of the Euclidean plane avoiding distance 1
A subset A ⊂ R^2 is said to avoid distance 1 if: ∀ x,y ∈ A, x-y _2 ≠1....
research
∙
07/23/2018
On Minimum Connecting Transition Sets in Graphs
A forbidden transition graph is a graph defined together with a set of p...
research
∙
10/24/2017
