29 citations · 334 across the 88 of their papers we have counts for
1 paper · 2 filters
Maria Chudnovsky, Neil Robertson, Paul Seymour +1
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…