Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I

DOI10.1016/0012-365X(81)90140-0zbMath0464.05050MaRDI QIDQ1153930

Hans-Dietrich O. F. Gronau

Publication date: 1981

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

zbMATH Keywords

complete graph; critical covering

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

Graph theory (algorithmic, algebraic, and metric problems), Interval Packing and Covering in the Boolean Lattice

Cites Work

• Unnamed Item
• On the coverings of graphs
• On the theory of graphs