d-extensible sets of stable sets in bipartite graphs

Marie-Christine Costa, Grégoire Cotté and Christophe Picouleau

july, 2014

Type de publication :

Conférence sans actes

Conférence :

GO IX, Ninth international colloquium on Graphs and Optimization

Résumé :

In a graph G = (V, E) a subset F of V is a d-extensible set if for any stable set S of F with |S|= d it exists a stable set S' of V-F F such that SUS' is a maximum stable set of G. We say that S can be extended to a maximum stable set with vertices outside of F, shortly S can be extended. We present a characterization of the d-extensible sets for the class of bipartite graphs and we determine, for some values of d, the maximum cardinality of a d-extensible set. We also determine the maximum cardinality of a d-extensible set for a subclass of arborescences where any vertex x of V belongs to a maximum stable set. This problem has some applications in reliability where we consider vertex failures in the graph G : a d-extensible set is the set of vertices that are not protected.

BibTeX :

@conference{Cos-Cot-Pic-2014,
    author={Marie-Christine Costa and Grégoire Cotté and Christophe 
           Picouleau },
    title={d-extensible sets of stable sets in bipartite graphs },
    publisher={GO IX, Ninth international colloquium on Graphs and 
           Optimization },
    year={2014 },
    month={7},
    pages={14},
}