Covering problems in graphs are specific instances of subgraph - finding problems .
Instances tend to be closely related to the clique problem or the independent set problem .
Covering problems in graphs are specific instances of subgraph - finding problems , and they tend to be closely related to the clique problem or the independent set problem .