Coloring ($P_5$, kite)-free graphs

Shenwei Huang, Yiao Ju, T. Karthick

Let $P_n$ and $K_n$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_4$ by adding a vertex and making it adj…