A note on vertex orders for stability number

Authors:
N. V. R. Mahadev;B. A. Reed
Affiliations:
Department of Mathematics, Northeastern University, Boston, MA 02115;Equipe Combinatoire, Case 189, Univerited de Pierre et Marie Curie, 4 Place Jussieu, Paris, France
Venue:
Journal of Graph Theory
Year:
1999

Citing 0
Cited 3

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set

Discrete Mathematics
Stable sets in two subclasses of banner-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Minimum degree algorithms for stability number

Discrete Applied Mathematics - Special issue on stability in graphs and related topics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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