We present new min-max relations in digraphs between the number of paths...
A temporal graph is a graph whose edges are available only at specific t...
We introduce the notion of delineation. A graph class 𝒞 is said
delineat...
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the mo...
We investigate a number of coloring problems restricted to bipartite gra...
A temporal digraph G is a triple (G, γ, λ) where G is
a digraph, γ is a ...
In the Directed Disjoint Paths problem, we are given a digraph D and a s...