📐 Strong Perfect Graph Theorem
A graph is perfect if and only if it contains no odd hole and no odd antihole as an induced subgraph.
From: Introduction to Graph Theory
Learn more: https://west-graphs-deploy.vercel.app/#/section/23
Explore all courses: https://mathacademy-cyan.vercel.app