Packings and coverings of the complete directed multigraph with 3- and 4-circuits

DOI10.1016/0012-365X(95)00302-DzbMath0870.05059OpenAlexW2074137367MaRDI QIDQ1356652

Frank E. Bennett, Jianxing Yin

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00302-d

zbMATH Keywords

directed graphpacking numbercovering numberdirected cycleMendelsohn designcomplete directed multigraphmaximal packingsminimal coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ Coverings and packings of complete directed graphs by odd circuits ⋮ Special issue: 2nd Shanghai conference on designs, codes and finite geometries. Shanghai Jiao Tong Univ., Shanghai, China, May 14--18, 1996 ⋮ Recent progress on the existence of perfect Mendelsohn designs ⋮ Packings of the complete directed graph with \(m\)-circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of the complete directed graph into k-circuits
• An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits

This page was built for publication: Packings and coverings of the complete directed multigraph with 3- and 4-circuits