Séminaire Lotharingien de Combinatoire, B10p (1984), 4 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-10, p.
88-91.]
Martin Grötschel
Characterisations of Perfect Graphs
Abstract.
We provide a new characterization of a graph G being
perfect (as defined by Berge) in terms of a certain convex
set, denoted here by THETA(G), being a polytope or not.
The following version is available: