Some classes of strongly perfect graphs
A graph is said to be strongly perfect if each of its induced subgraphs \(H\) contains an independent set which meets all the cliques (maximal complete subgraphs) in it. Every strongly perfect graph is perfect but the converse is generally not valid. Meyniel graphs, line graphs that are free from some graphs, comparability graphs, costrongly perfect graphs are some of the most important classes of strongly perfect graphs. In this paper the results concerning strongly perfect graphs are summarized.
scientific article; zbMATH DE number 1340377