Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets - Université Clermont Auvergne Access content directly
Book Sections Year : 2018

Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets

Abstract

This work is devoted to the study of the Lovász-Schrijver PSD-operator LS+ applied to the edge relaxation ESTAB(G) of the stable set poly-tope STAB(G) of a graph G. In order to characterize the graphs G for which STAB(G) is achieved in one iteration of the LS+-operator, called LS+-perfect graphs, an according conjecture has been recently formulated (LS+-Perfect Graph Conjecture). Here we study two graph classes defined by clique cutsets (pseudothreshold graphs and graphs without certain Truemper configurations). We completely describe the facets of the stable set polytope for such graphs, which enables us to show that one class is a subclass of LS+-perfect graphs, and to verify the LS+-Perfect Graph Conjecture for the other class.
Fichier principal
Vignette du fichier
w_isco2018_hal.pdf (288.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02017441 , version 1 (13-02-2019)

Identifiers

  • HAL Id : hal-02017441 , version 1

Cite

Annegret K. Wagler. Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. Combinatorial Optimization: ISCO 2018, pp.416-427, 2018. ⟨hal-02017441⟩
47 View
192 Download

Share

Gmail Facebook Twitter LinkedIn More