Recognition Algorithm Given the List of Maximal Cliques

Is there a polytime recognition algorithm for perfect graphs where the input is the list of all maximal cliques in the graph? This probelm has been resolved, since a perfect graph can itself now be recognized.

Contributed by Bruce Shepherd

Back to the main index for Perfect Graphs.