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.

中文翻译：

---

极小非理想图的新示例

如果每个归纳子图都非常理想$H$ 有一个稳定的集合，可以满足每个非空的最大集团 $H$。通过一组禁止的诱导子图来描述强理想图的特性是未知的。在这里，我们提供了几个新的最小非完全理想图。