Lucke, Felicia Ries, Bernard 2024 In this paper, we consider the following two problems: (i) Deletion Blocker(α) where we are given an undirected graph G = (V, E) and two integers k, d ≥ 1 and ask whether there exists a subset of vertices S ⊆ V with |S| ≤ k such that α(G−S) ≤ α(G)−d, that is the independence number of G decreases by at least d after having removed the vertices from S; (ii) Transversal(α) where we are given an undirected graph G = (V, E) and two integers k, d ≥ 1 and ask whether there exists a subset of vertices S ⊆ V with |S| ≤ k such that for every maximum independent set I we have |I ∩ S| ≥ d. We show that both problems are polynomial-time solvable in the class of co-comparability graphs by reducing them to the well-known Vertex Cut problem. Our results generalise a result of Chang et al. (2001) and a recent result of Hoang et al. (2023). application/pdf https://folia.unifr.ch/global/documents/328987 https://folia.unifr.ch/documents/328987/files/co-comparability.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2024.06.020 info:eu-repo/semantics/altIdentifier/issn/0166-218X info:eu-repo/semantics/openAccess CC BY Discrete Applied Mathematics. - Elsevier BV. - 2024, vol. 356, p. 307-321 Blocker problems Transversal problems Vertex deletion Independence number Co-comparability graph info:eu-repo/classification/udc/51 On blockers and transversals of maximum independent sets in co-comparability graphs http://purl.org/coar/resource_type/c_6501