Characterizing N+-perfect line graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Transactions in Operational Research Année : 2017

Characterizing N+-perfect line graphs

Mariana Escalante
  • Fonction : Auteur
Graciela Nasini
  • Fonction : Auteur
  • PersonId : 1043176

Résumé

The subject of this contribution is the study of the Lovász-Schrijver PSD-operator N + applied to the edge relaxation of the stable set poly-tope of a graph. We are particularly interested in the problem of characterizing graphs for which N + generates the stable set polytope in one step, called N +-perfect graphs. It is conjectured that the only N +-perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving that in an N +-perfect line graph the only facet-defining subgraphs are cliques and odd holes.
Fichier principal
Vignette du fichier
ENW_itor_revised_2.pdf (278.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02047314 , version 1 (24-02-2019)

Identifiants

  • HAL Id : hal-02047314 , version 1

Citer

Mariana Escalante, Graciela Nasini, Annegret K Wagler. Characterizing N+-perfect line graphs. International Transactions in Operational Research, 2017, 24 (1-2), pp.325-337. ⟨hal-02047314⟩
19 Consultations
78 Téléchargements

Partager

Gmail Facebook X LinkedIn More