Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs

In Brandstädt and Giakoumakis [2], we reduce the Maximum Weight Independent Set (MWIS) problem on hole- and co-chair-free graphs to a corresponding problem on prime atoms. Here we refine these results by investigating atoms of prime graphs (avoiding the requirement that the graphs are prime and atoms) and also observe that the MWIS problem is solvable in polynomial time on (odd-hole, co-chair)-free graphs.