Directed complete bipartite graph decompositions: indirect constructions

DOI10.1016/j.disc.2006.11.050zbMath1183.05065OpenAlexW2010841183MaRDI QIDQ2468018

Violet R. Syrotiuk, Charles J. Colbourn, Peter J. Dukes

Publication date: 30 January 2008

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

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

zbMATH Keywords

packingscoveringsgraph designsgraph decompositions

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Decompositions of edge-colored complete graphs
• Ternary Schedules for Energy-Limited Sensor Networks
• Directed star decompositions of the complete directed graph
• A Note on the Block Structure of BIB Designs
• Super-simple designs with \(v\leq 32\)

This page was built for publication: Directed complete bipartite graph decompositions: indirect constructions