Maximum Weight Stable Set In (P-7, Bull)-Free Graphs And (S-1,S-2,S-3, Bull)-Free Graphs

We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce). With the same arguments we also give a polynomial algorithm for any graph that does not contain S-1,S-2,S-3 or a bull. (C) 2017 Elsevier B.V. All rights reserved.