Complete bipartite decompositions of crowns, with applications to complete directed graphs
From MaRDI portal
Publication:6567671
DOI10.1007/3-540-61576-8_74zbMATH Open1543.05149MaRDI QIDQ6567671
Jenq-Jong Lin, Tay-Woei Shyu, Chiang Lin
Publication date: 5 July 2024
directed complete bipartite decomposition of complete directed graphsminimum number of complete bipartite subgraphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new proof of a theorem of Graham and Pollak
- On the addressing problem for directed graphs
- Decomposition of product graphs into complete bipartite subgraphs
- Dimension of the crown \(S^k_n\)
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
- On the decomposition ofkn into complete bipartite graphs
This page was built for publication: Complete bipartite decompositions of crowns, with applications to complete directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567671)
