Preprint
Sep 2026
Almost perfect graph classes
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. Motivated by this forbidden induced subgraph characterization of the class of perfect graphs as well as the possible extension of ef...
Cicely Henderson, Hidde Koerts, Taite LaGrange et al.
· 0 citations