Abstract
AbstractWe consider the following problem: for a given graph G and two integers k and d, can we apply a fixed graph operation at most k times in order to reduce a given graph parameter $$\pi $$
π
by at least d? We show that this problem is NP-hard when the parameter is the independence number and the graph operation is vertex deletion or edge contraction, even for fixed $$d=1$$
d
=
1
and when restricted to chordal graphs. We give a polynomial time algorithm for bipartite graphs when the operation is edge contraction, the parameter is the independence number and d is fixed. Further, we complete the complexity dichotomy for H-free graphs when the parameter is the clique number and the operation is edge contraction by showing that this problem is NP-hard in $$(C_3+P_1)$$
(
C
3
+
P
1
)
-free graphs even for fixed $$d=1$$
d
=
1
. When the operation is edge deletion and the parameter is the chromatic number, we determine the computational complexity of the associated problem for cographs and complete multipartite graphs. Our results answer several open questions stated in Diner et al. (Theor Comput Sci 746:49–72, 2012, https://doi.org/10.1016/j.tcs.2018.06.023).
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference18 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows-Theory, Algorithms and Applications, pp. 461–509. Prentice Hall, New Jersey (1993)
2. Bazgan, C., Bentz, C., Picouleau, C., Ries, B.: Blockers for the stability number and the chromatic number. Graph. Comb. 31(1), 73–90 (2015)
3. Bentz, C., Costa, M.C., de Werra, D., Picouleau, C., Ries, B.: Minimum $$d$$-transversals of maximum-weight stable sets in trees. Electron. Notes Discrete Math. 38, 129–134 (2011). https://doi.org/10.1016/j.endm.2011.09.022, the Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011
4. Bodlaender, H.L., Möhring, R.H.: The pathwidth and treewidth of cographs. In: Scandinavian Workshop on Algorithm Theory. pp. 301–309. Springer (1990)
5. Cerioli, M.R., Lima, P.T.: Intersection of longest paths in graph classes. Discrete Appl. Math. 281, 96–105 (2020). https://doi.org/10.1016/j.dam.2019.03.022, LAGOS’17: IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M., Marseille, France - 2017