Blocking dominating sets for H-free graphs via edge contractions
share
In this paper, we consider the following problem: given a connected graph G, can we reduce the domination number of G by one by using only one edge contraction? We show that the problem is coNP-hard when restricted to subcubic claw-free graphs and P_7-free graphs.
READ FULL TEXT