Galby, Esther Mann, Felix Ries, Bernard 2021-09-23 In this note, we consider the following problem: given a connected graph G, can we reduce the domination number of G by using only one edge contraction? We show that the problem is polynomial-time solvable on (P3 + kP2)-free graphs for any k ≥ 0 which can be combined with former results to obtain a complexity dichotomy of the problem on H-free graphs. application/pdf https://folia.unifr.ch/global/documents/322005 https://folia.unifr.ch/documents/322005/files/p3kp2_0.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2021.09.009 info:eu-repo/semantics/altIdentifier/issn/0166-218X info:eu-repo/semantics/openAccess CC BY Discrete Applied Mathematics. - Elsevier BV. - 2021, vol. 305, p. 205-210 Applied Mathematics Discrete Mathematics and Combinatorics Domination Edge contraction Graph theory info:eu-repo/classification/udc/004 Reducing the domination number of (P3+kP2)-free graphs via one edge contraction http://purl.org/coar/resource_type/c_6501