Optimal chromatic bound for ($P_2+P_3$, $\overline{P_2+P_3}$)-free graphs

Arnab Char, T. Karthick

For a graph $G$, let $\chi (G)$ ($\omega (G)$) denote its chromatic (clique) number. A $P_2+P_3$ is the graph obtained by taking the disjoint union of a two-vertex path $P_2$ and a three-ver…