strongly perfect graph
graph for which every induced subgraph H has an independent set meeting all maximal cliques of H
Facts
1 property- Subclass of
- perfect graph[1]
🏷️ Also known as
en strongly perfect graph
de stark perfekter Graph
🔖 Identifiers · 3
- Graphclasses.org ID
- gc_267
- MathWorld ID
- StronglyPerfectGraph
- Wolfram Language entity code
- Entity["GraphClass", "StronglyPerfect"]
Press Enter · cited answer in seconds