Critical edges in perfect graphs and some polyhedral consequences:

Abstract: "An edge [epsilon] of a perfect graph G is called critical if G - [epsilon] is imperfect. For certain graphs G - [epsilon] of this type, we determine all minimally imperfect subgraphs. We use this knowledge to describe inequalities inducing facets of the stable set polytope associated...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Wagler, Annegret 1968- (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Berlin Konrad-Zuse-Zentrum für Informationstechnik 1997
Schriftenreihe:Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1997,46
Schlagworte:
Zusammenfassung:Abstract: "An edge [epsilon] of a perfect graph G is called critical if G - [epsilon] is imperfect. For certain graphs G - [epsilon] of this type, we determine all minimally imperfect subgraphs. We use this knowledge to describe inequalities inducing facets of the stable set polytope associated with G - [epsilon]."
Beschreibung:10 S. graph. Darst.