All P3P3-equipackable graphs

A graph GG is P3P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3P3 from GG always terminates with a graph having at most one edge. All P3P3-equipackable graphs are characterised. They belong to a small number of families listed here.