A class of self-orthogonal 2-sequencings (Q1182413)

The paper investigates the problem of ``partitioning'' \(2K_ n\), the complete multigraph on \(n\) vertices in which each pair of distinct vertices is joined by precisely two edges, into Hamilton paths such that each pair of distinct such paths has precisely one edge in common. The authors use 2-sequencings (terraces) to formulate the problem and construct suitable 2-sequencings to establish the existence of the required ``partitions'' for new classes of integers \(n\).