Abstract

Mahadev and Reed (J. Graph Theory 30(2) (1999) 113) found a finite forbidden induced subgraph characterization for the maximal hereditary class of graphs where a minimum degree greedy algorithm produces a maximum stable set. We extend this class.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call