Molecules arranging themselves into predictable patterns on silicon chips could lead to microprocessors with much smaller circuit elements. Mathematically, assembling in predictable patterns is equivalent to packing in graphs. An H-packing of a graph G is a set of vertex disjoint subgraphs of G, each of which is isomorphic to a fixed graph H. If H is the complete graph K 2, the maximum H-packing problem becomes the familiar maximum matching problem. In this paper we give algorithms to find a perfect packing of HC(n) with P 6 and K 1,3 when n is even and thus determines their packing numbers. Further we also study the packing of HC(n) with 1, 3-dimethyl cyclohexane.