Independent Sets in Classes Related to Chair/Fork-free Graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. MWIS is known to be NP -complete in general, even under various restrictions. Let Si,j,k be the graph consisting of three induced paths of lengths i, j, k with a common initial vertex. The complexity of the… CONTINUE READING