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

Ahmed Ainouche1, Zineb Benmeziane 2
1CEREGMIA, UAG BP7209, 97275 Schoelcher Cedex French West Indies
2 Institut de Mathématiques, USTHB BP 32, El-Alia 16111 Ager Algeria

Abstract

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