($P_2+P_4$, $K_4-e$)-free graphs are nearly $\ddot{I}‰$-colorable

C. U. Angeliya, T. Karthick, Shenwei Huang

For a graph $G$, $\ddot{I}‡(G)$ and $\ddot{I}‰(G)$ respectively denote the chromatic number and clique number of $G$. In this paper, we show the following results: (i) If $G$ is a ($P_2+P_4$, $K…