Given a finite group $G$, write $K(G)$ for the complete digraph on the elements of $G$. Label the edge from $g$ to $h$ by element $g^{-1}h$.

**Question**: For what groups does there exist a Hamiltonian path in $K(G)$ whose edge labels exhaust the elements of $G$, apart from the identity?

Some observations:

If $G={\Bbb Z}/12{\Bbb Z}$, mathematical music theory calls such paths "all-interval rows."

No such paths exist for cyclic groups of odd order greater than 1 because the sum of all elements in such a group equals the identity. More generally, when $G$ abelian has such a path, I believe that $G$ must have exactly one factor of even order when expressed as a product of cyclic groups, or equivalently, a unique element of order 2. I don't know the status of the converse.

Any Hamiltonian path determines a sequence of $|G|-1$ non-identity edge labels. Heuristically, a random such sequence has probability $(|G|-1)!/ {(|G|-1)}^{|G|-1}$ of having no repeated labels. This predicts that the desired paths exist in great profusion, at least absent any global obstruction as in the previous comment. Where I have made exhaustive searches either no desired paths turned up at all, or I saw a total reasonably consistent with the heuristic. Can one prove or disprove anything along these lines? Even-order cyclic groups have paths of the desired sort, but I don't have any interesting bounds on the total counts even in this case.

The case of dihedral times ${\Bbb Z}/2{\Bbb Z}$ has mathematical music theory interest. Paths exist in profusion with the dihedral group factor having order 6, 8, 10, 12 or 24 (the musically most interest case!), but I've yet to see any desired paths searching orders 14, though this might simply reflect the vast size of the search space. (I have now found examples for 24, but only by using an ad hoc hack whose effectiveness I don't understand.)