Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique

An algorithm for finding the independence number of a $n$-vertex graph from the class $\operatorname{Free}(\{P_5,C_5,K_p\})$ in time $O(n^{p+O(1)})$ is proposed. Bibliogr. 10.