Packings of the complete directed graph with \(m\)-circuits

DOI10.1007/S11766-998-0060-0zbMath0929.05069OpenAlexW148029758MaRDI QIDQ1288226

Zhi-He Liang, Qing-de Kang

Publication date: 25 January 2000

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0060-0

zbMATH Keywords

packing number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Coverings and packings of complete directed graphs by odd circuits

Cites Work

• Decomposition of the complete directed graph into k-circuits
• Packings and coverings of the complete directed multigraph with 3- and 4-circuits
• Optimal packing of even circuits into a \(\text{DK}_ v\)

This page was built for publication: Packings of the complete directed graph with \(m\)-circuits