# strongly perfect graph

> graph for which every induced subgraph H has an independent set meeting all maximal cliques of H

**Wikidata**: [Q136231915](https://www.wikidata.org/wiki/Q136231915)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Strongly_perfect_graph)  
**Source**: https://4ort.xyz/entity/strongly-perfect-graph