On forbidden induced subgraphs for K_{1,3}-free perfect graphs

Christoph Brause, Přemysl Holub, Adam Kabela +3

Considering connected $K_{1,3}$-free graphs with independence number at least $3$, Chudnovsky and Seymour (2010) showed that every such graph, say $G$, is $2\omega$-colourable where $\omega$…