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.

chordal graph | graph antihole | graph hole | perfect graph | strong perfect graph theorem