Packing and Covering are some of the fundamental problems in graph theory. An H- P ACKING problem is, given a graph G, what is the maximum number of disjoint graphs in H one can find in G. Similarly in H-C OVERING problem ...