Coverings and packings of complete directed graphs by odd circuits

DOI10.1080/09720529.2011.10698323zbMath1220.05101OpenAlexW1964970289MaRDI QIDQ3004492

Zhi-He Liang

Publication date: 3 June 2011

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1037101H_04_JDMSC_T05_14-1_pp051-075a.pdf

zbMATH Keywords

packing numbercovering numbercomplete directed graph\(m\)-circuit

Mathematics Subject Classification ID

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

Cites Work

• Packings of the complete directed graph with \(m\)-circuits
• Packings and coverings of the complete directed multigraph with 3- and 4-circuits
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Optimal packing of even circuits into a \(\text{DK}_ v\)

This page was built for publication: Coverings and packings of complete directed graphs by odd circuits