Group divisible (K₄-e)-packings with any minimum leave

A decomposition of $K_{n(g)}\setminus L$, the complete n-partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of $K_{n(g)}$ with G if L contains as few edges as possible. We examine all possible minimum leaves for maximum group divisible $(K_4-e)$-packings. Necessary and sufficient conditions are established for their existences.