Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I
From MaRDI portal
Publication:1153930
DOI10.1016/0012-365X(81)90140-0zbMath0464.05050MaRDI QIDQ1153930
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Interval Packing and Covering in the Boolean Lattice ⋮ Graph theory (algorithmic, algebraic, and metric problems)
Cites Work
This page was built for publication: Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I
