Directed 3-cycle decompositions of complete directed graphs with quadratic leaves

DOI10.1016/j.disc.2008.05.039zbMath1181.05076OpenAlexW2082346181MaRDI QIDQ1044938

Hao Shen, Hung-Lin Fu, Liqun Pu

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.039

zbMATH Keywords

packingcomplete directed graphMendelsohn triples

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic leaves of maximal partial triple systems
• Balanced incomplete block designs and related designs
• Decomposing \(K_{n} \cup P\) into triangles

This page was built for publication: Directed 3-cycle decompositions of complete directed graphs with quadratic leaves