The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for -free graphs, and for -free graphs are unknown. In this note, we give a proof for the solvability of the MWIS problem for (, , co-chair)-free graphs in polynomial time, by analyzing the structure and the MWIS problem in various subclasses of (, , co-chair)-free graphs. These results extend some known results in the literature.