On biclique decompositions of complete t-partite graphs
From MaRDI portal
Cites work
- A new proof of a theorem of Graham and Pollak
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
- scientific article; zbMATH DE number 426159 (Why is no real title available?)
- scientific article; zbMATH DE number 3930895 (Why is no real title available?)
- scientific article; zbMATH DE number 4093503 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
- Multicolored forests in bipartite decompositions of graphs
- On biclique partitions of the complete graph
- On the Addressing Problem for Loop Switching
- On the decomposition ofkn into complete bipartite graphs
Cited in
(11)- Complete multipartite decompositions of complete graphs and complete n-partite graphs
- A tree whose complement is not eigensharp
- Clique decompositions of multipartite graphs and completion of Latin squares
- scientific article; zbMATH DE number 5077172 (Why is no real title available?)
- scientific article; zbMATH DE number 4093503 (Why is no real title available?)
- scientific article; zbMATH DE number 1195744 (Why is no real title available?)
- On the termination of some biclique operators on multipartite graphs
- scientific article; zbMATH DE number 7316311 (Why is no real title available?)
- Some eigensharp and almost eigensharp graphs
- On a symmetric representation of Hermitian matrices and its applications to graph theory
- On eigensharp and almost eigensharp graphs
This page was built for publication: On biclique decompositions of complete \(t\)-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805302)