2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/111018We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation algorithms for certain graph classes.9 pagesDiscrete Mathematicstext