research
∙
06/10/2023
List homomorphisms to separable signed graphs
The complexity of the list homomorphism problem for signed graphs appear...
share
research
∙
06/02/2022
Min orderings and list homomorphism dichotomies for signed and unsigned graphs
The CSP dichotomy conjecture has been recently established, but a number...
research
∙
07/17/2021
On the Kernel and Related Problems in Interval Digraphs
Given a digraph G, a set X⊆ V(G) is said to be absorbing set (resp. domi...
research
∙
05/12/2020
List homomorphism problems for signed graphs
We consider homomorphisms of signed graphs from a computational perspect...
research
∙
09/09/2019
Strongly chordal digraphs and Γ-free matrices
We define strongly chordal digraphs, which generalize strongly chordal g...
research
∙
07/16/2019
Vertex arboricity of cographs
Arboricity is a graph parameter akin to chromatic number, in that it see...
research
∙
06/28/2019
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
We consider acyclic r-colorings in graphs and digraphs: they color the v...
research
∙
07/04/2018
Distance-Two Colorings of Barnette Graphs
Barnette identified two interesting classes of cubic polyhedral graphs f...
research
∙
04/14/2018
