Galby, Esther Lima, Paloma T. Mann, Felix Ries, Bernard 2022-10-21 In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting kedges, for some fixed k ≥1. We show that this can always be done with at most 3 edge contractions and further characterise those graphs requiring 1, 2 or 3 edge contractions, respectively, to decrease their semitotal domination number. We then study the complexity of the problem for k =1 and obtain in particular a complete complexity dichotomy for monogenic classes. application/pdf https://folia.unifr.ch/global/documents/323687 https://folia.unifr.ch/documents/323687/files/1-s2.0-s0304397522006090-main1.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2022.10.020 info:eu-repo/semantics/altIdentifier/issn/0304-3975 info:eu-repo/semantics/openAccess CC BY Theoretical Computer Science. - Elsevier BV. - 2023, vol. 939, p. 140-160 Blocker problem Edge contraction Semitotal domination info:eu-repo/classification/udc/004 Using edge contractions to reduce the semitotal domination number http://purl.org/coar/resource_type/c_6501