Give a polynomial time recognition algorithm for Berge graphs with polynomially bounded number of maximal cliques.
Contributed by Jeremy Spinrad.
Back to the main index for Perfect Graphs.