Disjoint circuits on a Klein bottle and a theorem on posets (Q1210554)

The authors use common features of the proofs of theorems which they et al. had a hand in when solving a problem of packing disjoint directed circuits in a digraph drawn on a Klein bottle or a torus to produce a class of posets (wrt \(\leq)\) for which another relation \((<)\) is also defined which ``intertwines'' with \((\leq)\) in a special way and whose properties (per axioms) are such that a single proof can be constructed which via proper interpretation yields the original theorems on which the construction was based as consequences. Besides indicating an interesting class of ``more-than-posets'' \((\leq,<)\) it is also another demonstration of the complex but everpresent way that combinatorial-topological arguments can be undisguised to reveal an underlying barer structure where order governs the flow of arguments in a natural even if somewhat complex way.