Directed complete bipartite graph decompositions: indirect constructions

DOI10.1016/J.DISC.2006.11.050MaRDI QIDQ2468018zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Violet R. Syrotiuk, Peter 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

coveringspackingsgraph decompositionsgraph designs

Mathematics Subject Classification ID

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

Recommendations

• Minimum broadcast tree decompositions
• On the spectra of bipartite directed subgraphs of \(K^\ast_4\)
• Directed star decompositions of the complete directed graph
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Large sets of oriented \(P_3\)-decompositions of directed complete bipartite graphs

Cites work

• scientific article; zbMATH DE number 3995714 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• A Note on the Block Structure of BIB Designs
• Decompositions of edge-colored complete graphs
• Directed star decompositions of the complete directed graph
• Super-simple designs with \(v\leq 32\)
• Ternary Schedules for Energy-Limited Sensor Networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468018)