Galby, Esther Mann, Felix Ries, Bernard 2021-03-26 In this paper, we study the problem of deciding whether the total domination number of a given graph Gcan be reduced using exactly one edge contraction (called1-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. application/pdf https://folia.unifr.ch/global/documents/309575 https://folia.unifr.ch/documents/309575/files/2021_Galby_Blocking.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2021.03.028 info:eu-repo/semantics/openAccess License undefined Theoretical Computer Science. - Elsevier. - 2021, vol. 877, p. 18-35 Total dominating set Edge contraction H-free graphs Computational complexity Blocker problem info:eu-repo/classification/udc/004 Blocking Total Dominating Sets Via Edge Contractions http://purl.org/coar/resource_type/c_6501