Weighted independent sets in classes of P6-free graphs

Authors

T. Karthick, Indian Statistical Institute Chennai
Frédéric Maffray, Université Grenoble Alpes

Article Type

Research Article

Publication Title

Discrete Applied Mathematics

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.

First Page

217

Last Page

226

DOI

10.1016/j.dam.2015.10.015

Publication Date

8-20-2016

Comments

Open Access; Bronze Open Access

Recommended Citation

Karthick, T. and Maffray, Frédéric, "Weighted independent sets in classes of P6-free graphs" (2016). Journal Articles. 4525.
https://digitalcommons.isical.ac.in/journal-articles/4525