Nesting directed cycle systems of even length

DOI10.1016/0195-6698(92)90026-VzbMath0767.05063OpenAlexW1964088628MaRDI QIDQ1193557

C. A. Rodger, Douglas R. Stinson

Publication date: 27 September 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(92)90026-v

zbMATH Keywords

digraphscycle systems

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Sampling complete designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nesting of cycle systems of odd length
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
• Existence of resolvable path designs
• On resolvable mixed path designs
• The spectrum of nested Steiner triple systems
• Decomposition of complete multigraphs into stars
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Nesting and almost resolvability of pentagon systems
• On the construction of odd cycle systems
• Directed star decompositions of the complete directed graph

This page was built for publication: Nesting directed cycle systems of even length