Stability Number of a Subclass of Chair-Free, Net-Free Graphs

Abstract

We describe a class of graphs $\mathrm{\Gamma }$ for which the stability number can be obtained in polynomial time. A graph in class $\mathrm{\Gamma }$ is chair-free, net-free, and has the property that the claw-centers form an independent set.