Decomposition of a $3K_{8t}$ into $H_2$ Graphs

Abstract

An $H_2$ graph is a multigraph on three vertices with a double
edge between a pair of distinct vertices and single edges between
the other two pairs. In this paper, we settle the $H_2$ graph
decomposition problem, which was left unfinished in a paper of
Hurd and Sarvate, by decomposing a complete multigraph $3K_{8t}$
into $H_2$ graphs recursively.