On biclique partitions of the complete graph

DOI10.1016/0012-365X(93)90335-QMaRDI QIDQ686164zbMATH OpenFDO

Authors Bryan L. Shader

Publication date 1 November 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete matchingcomplete graphbiclique partitions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 4093503
• scientific article; zbMATH DE number 426159
• scientific article; zbMATH DE number 4087706
• Partitions of complete bipartite geometric graphs into plane perfect matchings
• On biclique coverings

Cites work

• scientific article; zbMATH DE number 426159 (Why is no real title available?)
• scientific article; zbMATH DE number 4142068 (Why is no real title available?)
• scientific article; zbMATH DE number 3657692 (Why is no real title available?)
• scientific article; zbMATH DE number 3995714 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3329635 (Why is no real title available?)
• scientific article; zbMATH DE number 3395950 (Why is no real title available?)
• A new proof of a theorem of Graham and Pollak
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• On the Addressing Problem for Loop Switching
• On the decomposition ofkn into complete bipartite graphs
• On the tournament matrices with smallest rank

Cited in

(17)

• The splitting number of complete bipartite graphs
• scientific article; zbMATH DE number 125474 (Why is no real title available?)
• On biclique decompositions of complete \(t\)-partite graphs
• Regarding two conjectures on clique and biclique partitions
• On biclique coverings
• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
• scientific article; zbMATH DE number 4093503 (Why is no real title available?)
• Partitions of complete bipartite geometric graphs into plane perfect matchings
• A graph partition problem
• scientific article; zbMATH DE number 4045794 (Why is no real title available?)
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• On the termination of some biclique operators on multipartite graphs
• Relaxed complete partitions: an error-correcting Bachet's problem
• Some remarks on Baranyai's theorem
• The number of tournaments with the minimum number of upsets
• scientific article; zbMATH DE number 426159 (Why is no real title available?)

This page was built for publication: On biclique partitions of the complete graph

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