Coloring graphs with no induced five-vertex path or gem

M. Chudnovsky, T. Karthick, P. Maceli +1

For a graph $G$, let $\chi (G)$ and $\omega (G)$ respectively denote the chromatic number and clique number of $G$. We give an explicit structural description of ($P_5$,gem)-free graphs, and…