Given a finite family ℱ of graphs, we say that a graph G is
"ℱ-free" if ...
Given a digraph G, a set X⊆ V(G) is said to be absorbing set
(resp. domi...
A graph G is said to be the intersection of graphs G_1,G_2,...,G_k if
V(...
The lexicographic method is a technique that was introduced by Hell and ...
Planar graphs are the graphs with Dushnik-Miller dimension at most three...
An oriented graph is a directed graph with no loops or digons. The secon...
We introduce the notion of stab number and exact stab number of
rectangl...