In a graph G:=(V(G),E(G))G:=(V(G),E(G)), a subset MM of the vertex set V(G)V(G) is a module (or interval, clan) of GG if every vertex outside MM is adjacent to all or none of MM. The empty set, the singleton sets, and the full set of vertices are trivial modules. The graph GG is indecomposable (or prime) if all its modules are trivial. If GG is indecomposable, we say that an edge ee of GG is a removable edge if G−eG−e is indecomposable (here G−e:=(V(G),E(G)−{e})G−e:=(V(G),E(G)−{e})). The graph GG is said to be unstable if it has no removable edges. For a positive integer kk, the kkth power GkGk of a graph GG is the graph obtained from GG by adding an edge between all pairs of vertices of GG with distance at most kk. A graph GG of order nn (i.e., |V(G)|=n|V(G)|=n) is said to be pp-placeable into GkGk, if GkGk contains pp edge-disjoint copies of GG. In this paper, we answer a question, suggested by Boudabbous in a personal communication, concerning unstable graphs and packing into their fifth power as follows: First, we give a characterization of the unstable graphs which is deduced from the results given by Ehrenfeucht, Harju and Rozenberg (the theory of 22-structures: a framework for decomposition and transformation of graphs). Second, we prove that every unstable graph GG is 22-placeable into G5G5.