We study the problem of reconfiguring one minimum s-t-separator A into
a...
A jump is a pair of consecutive elements in an extension of a poset whic...
A strong geodetic set of a graph G=(V,E) is a vertex set S ⊆ V(G)
in whi...
A matching M is a 𝒫-matching if the subgraph induced by the
endpoints of...
The CONTRACTION(vc) problem takes as input a graph G on n vertices and
t...
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized
subgrap...
A locating-dominating set D of a graph G is a dominating set of G where
...
In the Selective Coloring problem, we are given an integer k, a graph G,...
An orientation D of a graph G=(V,E) is a digraph obtained from G by
repl...
The three-in-a-tree problem asks for an induced tree of the input graph
...
For a graph parameter π, the Contraction(π) problem consists in,
given a...
We present the first results on the complexity of the reconfiguration of...
A biclique of a graph G is an induced complete bipartite subgraph of G
s...
An n-vertex graph is equitably k-colorable if there is a proper coloring...
We present some complexity results concerning the problems of covering a...
A graph on n vertices is equitably k-colorable if it is k-colorable and
...
Chordal graphs are the graphs in which every cycle of length at least fo...