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.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.