Blockers for the stability number and the chromatic number - Archive ouverte HAL
Journal Articles Graphs and Combinatorics Year : 2015

Blockers for the stability number and the chromatic number

Abstract

Given an undirected graph G = (V,E) and two positive integers k and d, we are interested in finding a set of edges (resp. non-edges) of size at most k to delete (resp. to add) in such a way that the chromatic number (resp. stability number) in the resulting graph will decrease by at least d compared to the original graph. We investigate these two problems in various classes of graphs (split graphs, threshold graphs, (complement of) bipartite graphs) and determine their computational complexity. In some of the polynomial-time solvable cases, we also give a structural description of a solution.
Fichier principal
Vignette du fichier
GC.pdf (202.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01505546 , version 1 (11-04-2017)

Identifiers

Cite

Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries. Blockers for the stability number and the chromatic number. Graphs and Combinatorics, 2015, 31 (1), pp.73-90. ⟨10.1007/s00373-013-1380-2⟩. ⟨hal-01505546⟩
168 View
119 Download

Altmetric

Share

More