A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Blocking total dominating sets via edge contractions
2021
Theoretical Computer Science
Preserved Fulltext
In this paper, we study the problem of deciding whether the total domination number of a given graph G can be reduced using exactly one edge contraction (called 1-Edge Contraction(γ t )). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs.
doi:10.1016/j.tcs.2021.03.028
fatcat:gopvxea4qjft3bdaycfhnvkumq