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

DOI10.1016/0012-365X(95)00302-DzbMath0870.05059MaRDI 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 graph; packing number; covering number; directed cycle; Mendelsohn design; complete directed multigraph; maximal packings; minimal coverings

Mathematics Subject Classification ID

05C38: Paths and cycles

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

Related Items

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, Optimal packing of even circuits into a \(\text{DK}_ v\), Coverings and packings of complete directed graphs by odd circuits

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item