Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics