Annals of Mathematics · 2006 · 1.3K citations · 17 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsTopologyGraph AlgorithmsGraph TheoryChromatic PolynomialsPerfect Graphs
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one.
17
Decomposition of regular matroids
Paul Seymour · Journal of Combinatorial Theory Series B · 1980 · 749 citations
A characterization of perfect graphs
László Lovász · Journal of Combinatorial Theory Series B · 1972 · 344 citations
Star-cutsets and perfect graphs
Vašek Chvátal · Journal of Combinatorial Theory Series B · 1985 · 196 citations
William McCuaig · The Electronic Journal of Combinatorics · 2004 · 137 citations · Full text