  A graph is strongly perfect if every induced subgraph H has a stable set that
meets every nonempty maximal clique of H. The characterization of strongly
perfect graphs by a set of forbidden induced subgraphs is not known. Here we
provide several new minimal non-strongly-perfect graphs.
