Abstract: A graph-pair of order $t$ is two non-isomorphic graphs $G$ and $H$ on $t$ non-isolated vertices for which $G \cup H \cong K_t$ for some integer $t \geq 4$. Given a graph-pair $(G,H)$, we say $(G,H)$ divides some graph $K$ if the edges of $K$ can be partitioned into copies of $G$ and $H$ with at least one copy of $G$ and at least one copy of $H$. We will refer to this partition as a {\it $(G,H)$-multidecomposition} of $K$. In this talk, we consider the existence of multidecompositions of $K_m - F$ for the graph-pairs of order 5 where $F$ is a Hamiltonian cycle or a 1-factor graph. For those graph-pairs, we will also look for maximum multipackings and minimum multicoverings of $K_m - F$.