Almost perfect graph classes

Cicely Henderson, Hidde Koerts, Taite LaGrange +4

A graph $G$ is perfect if $\omega (H)=\chi (H)$ for each induced subgraph $H$ of $G$. In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…