On Covering a Graph Optimally with Induced Subgraphs
<|reference_start|>On Covering a Graph Optimally with Induced Subgraphs: 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.<|reference_end|>
@article{thite2006on,
    title={On Covering a Graph Optimally with Induced Subgraphs},
    author={Shripad Thite},
    journal={arXiv preprint arXiv:cs/0604013},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0604013},
    primaryClass={cs.DM}
}