Maximum Weight Stable Set in ($P_7$, bull)-free graphs and ($S_{1,2,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 with also give a polynomial algorithm for any graph that does not contain $S_{1,2,3}$ or a bull. 
Fr\'ed\'eric Maffray, Lucas Pastor
math.CO cs.DM