Stability Number of Bull- and Chair-Free Graphs

Abstract A bull is the graph with vertices a, b, c, d, e and edges ab, ac, bc, ad, be ; a chair is the graph with vertices a, b, c, d, e and edges ab, bc, cd, be . We prove that the stability number of bull-free chair-free graphs can be found in polynomial time.