On some optimization problems for star-free graphs
В. Г. Найденко, Yury L. Orlovich · arXiv (Cornell University) · 2001
It is shown that in star-free graphs the maximum independent set problem, the minimum dominating set problem and the minimum independent dominating set problem are approximable up to constant factor by any maximal independent set.