2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30664It 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.6 pages, in RussianComputational ComplexityDiscrete MathematicsG.1.2; G.2.2On some optimization problems for star-free graphstext