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.