6 citations · 6 across the 1 of their papers we have counts for
1 paper
Gérard Cornuéjols
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line…