Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths

Alspach, B., Gavlas, H.: Cycle decompositions of K n and K n  − I. J. Combin. Theory Ser. B 81, 77–99 (2001)

Balister, P.: Packing circuits into K N . Combinatorics, Probability and Computing 10, 463–499 (2001)

Balister, P.: Packing closed trails into dense graphs. J. Combinatorial Theory, Ser. B 88, 107–118 (2003)

Billington, E.J., Cavenagh, N.J.: Decompositions of complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Mathematical Journal 57, 523–551 (2007)

Cavenagh, N.J., Billington, E.J.: On decomposing complete tripartite graphs into 5-cycles. Australas. J. Combin. 22, 41–62 (2000)

Horňák, M., Kocková, Z.: On complete tripartite graphs arbitrarily decomposable into closed trails. Tatra Mt. Math. Publ. 36, 71–107 (2007)

Horňák, M., Woźniak, M.: Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Mathematical Journal 53, 127–134 (2003)

Kocková, Z.: Decomposition of even graphs into closed trails, Abstract at Grafy ’03, Javorná, Czech Republic

Šajna, M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10, 27–78 (2002)