Coloring graph classes with no induced fork via perfect divisibility

T. Karthick, Jenny Kaufmann, Vaidy Sivaraman

For a graph $G$, $\chi (G)$ will denote its chromatic number, and $\omega (G)$ its clique number. A graph $G$ is said to be perfectly divisible if for all induced subgraphs $H$ of $G$, $V(H)…