We investigate the complexity of finding a transformation from a given
s...
Given a graph G and an integer k, a token addition and removal (TAR
for ...
Let G be a graph and T_1,T_2 be two spanning trees of G. We say that
T_1...
Let G be a graph and D_s and D_t be two dominating sets of
G of size k. ...
Given a dominating set, how much smaller a dominating set can we find th...
Given two colorings of a graph, we consider the following problem: can w...