A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Authors:
Néstor E. Aguilera;Mariana S. Escalante;Garaeila L. Nasini
Affiliations:
-;-;-
Venue:
Mathematics of Operations Research
Year:
2002

Citing 0
Cited 7

Clutter nonidealness

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On the commutativity of antiblocker diagrams under lift-and-project operators

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On a certain class of nonideal clutters

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Clutter nonidealness

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A polyhedral approach to the stability of a family of coalitions

Discrete Applied Mathematics
Note: On the behavior of the N+-operator under blocker duality

Discrete Applied Mathematics
Lift-and-project ranks and antiblocker duality

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we relate antiblocker duality between polyhedra, graph theory, and the disjunctive procedure. In particular, we analyze the behavior of the disjunctive procedure over the clique relaxation, ( G), of the stable set polytope in a graph R G, and the one associated to its complementary graph, R( G). We obtain a generalization of the Perfect Graph Theorem, proving that the disjunctive indices of R( G) and R( G) always coincide.