Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time

The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices maximum weight sum. MWIS is one the most investigated and important algorithmic graph problems; it well known to be NP-complete, remains NP-complete even under various strong restrictions such as triangle-free graphs. Its complexity Pk-free graphs, k≥7, an open problem. In [7], shown that can solved in polynomial time (P7,triangle)-free This result extended by Maffray Pastor [22] showing (P7,bull)-free same paper, they also showed (S1,2,3,bull)-free this using similar approach we show (S1,2,4,triangle)-free which generalizes