A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Packing Digraphs with Directed Closed Trails
2003
Combinatorics, probability & computing
It has been shown [Balister, 2001] that if n is odd and m 1 , . . . , mt are integers with m i ≥ 3 and t i=1 m i = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m 1 , . . . , mt. This result was later generalized [Balister, to appear] to all sufficiently dense Eulerian graphs G in place of Kn. In this article we consider the corresponding questions for directed graphs. We show that the compete directed graph ↔ Kn can be decomposed as an edge-disjoint
doi:10.1017/s0963548302005461
fatcat:cuhdzlqfbnbdxbnyqtywa4rgjq