A graph is called odd (respectively, even) if every vertex has odd
(resp...
Structural graph parameters, such as treewidth, pathwidth, and clique-wi...
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the
(A,ℓ)-Path Pac...
We study the complexity of the problems of finding, given a graph G, a
l...
Independent Set Reconfiguration is one of the most well-studied problems...
We study a family of generalizations of Edge Dominating Set on directed
...
In this paper we study the problem of finding a small safe set S in a gr...
We show that the independent set reconfiguration problem on split graphs...
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs th...
In Defective Coloring we are given a graph G = (V, E) and two integers
χ...