On Covering a Graph Optimally with Induced Subgraphs
arXiv:cs/0604013
Abstract
We 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 pages