On Covering a Graph Optimally with Induced Subgraphs
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 NPcompleteness of the problem, prove lower bounds, and give approximation algorithms for certain graph classes.
 Publication:

arXiv eprints
 Pub Date:
 April 2006
 arXiv:
 arXiv:cs/0604013
 Bibcode:
 2006cs........4013T
 Keywords:

 Computer Science  Discrete Mathematics
 EPrint:
 9 pages