A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge graph.
Berge Graph
See also
Chordal Graph, Graph Antihole, Graph Hole, Perfect Graph, Strong Perfect Graph TheoremExplore with Wolfram|Alpha
References
Chvátal, V. "The Strong Perfect Graph Theorem." https://users.encs.concordia.ca/~chvatal/perfect/spgt.html.Cornuéjols, G. "The Strong Perfect Graph Conjecture." In Proceedings of the International Congress of Mathematicians, Vol. III. Invited Lectures. Held in Beijing, August 20-28, 2002 (Ed. T. Li). Beijing, China: Higher Education Press, pp. 547-560, 2002. https://arxiv.org/abs/math/0304464.Referenced on Wolfram|Alpha
Berge GraphCite this as:
Weisstein, Eric W. "Berge Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BergeGraph.html