Abstract
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 P6-free graphs, and for S1,2,2-free graphs are unknown. In this note, we give a proof for the solvability of the MWIS problem for (P6, S1,2,2, co-chair)-free graphs in polynomial time, by analyzing the structure and the MWIS problem in various subclasses of (P6, S1,2,2, co-chair)-free graphs. These results extend some known results in the literature.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
