research
∙
11/25/2021
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
Given a finite family ℱ of graphs, we say that a graph G is "ℱ-free" if ...
share
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
∙
01/03/2020
Representing graphs as the intersection of cographs and threshold graphs
A graph G is said to be the intersection of graphs G_1,G_2,...,G_k if V(...
research
∙
12/12/2019
The Lexicographic Method for the Threshold Cover Problem
The lexicographic method is a technique that was introduced by Hell and ...
research
∙
09/14/2018
Dushnik-Miller dimension of d-dimensional tilings with boxes
Planar graphs are the graphs with Dushnik-Miller dimension at most three...
research
∙
08/07/2018
The Second Neighborhood Conjecture for some Special Classes of Graphs
An oriented graph is a directed graph with no loops or digons. The secon...
research
∙
04/18/2018
