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.
Citation
Ahmed Ainouche, Zineb Benmeziane . Stability Number of a Subclass of Chair-Free, Net-Free Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 025. 79-90. DOI: .