A note on vertex orders for stability number
N. V. R. Mahadev, Bruce A. Reed · Journal of Graph Theory · 1999
We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previously known classes of graphs for which the stability number can be computed in polynomial time. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 113–120, 1999