We give a time algorithm for the maximum weight stable set (MWS) problem on P₅- and co-chair-free graphs without recognizing whether the (arbitrary) input graph is P₅- and co-chair-free. This algorithm is based on the fact that prime P₅- and co-chair-free graphs containing 2K₂ are matched co-bipartite graphs and thus have very simple structure, and for 2K₂-free graphs, there is a polynomial time algorithm for the MWS problem due to a result of Farber saying that 2K₂-free graphs contain at most maximal stable sets. A similar argument can be used for (P₅,co-P)-free graphs; their prime graphs are 2K₂-free. Moreover, we give a complete classification of (P₅,co-chair,H)-free graphs with respect to their clique width when H is a one-vertex P₄ extension; this extends the characterization of (,co-chair)-free graphs called semi-P₄-sparse by Fouquet and Giakoumakis. For H being a house, P, bull or gem, the class of (P₅,co-chair,H)-free graphs has bounded clique width and very simple structure whereas for the other four cases, namely H being a co-gem, chair, co-P or C₅, the class has unbounded clique width due to a result of Makowsky and Rotics. Bounded clique width implies linear time algorithms for all algorithmic problems expressible in LinEMSOL—a variant of Monadic Second Order Logic including the MWS Problem.