Pages that link to "Item:Q4879175"
From MaRDI portal
The following pages link to Sharp bounds for decompositions of graphs into completer-partite subgraphs (Q4879175):
Displaying 9 items.
- On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
- On the line graphs of the complete \(r\)-partite graphs (Q1363708) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- Skew rank decompositions (Q1923213) (← links)
- Eigenvalues and clique partitions of graphs (Q2040995) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
- On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (Q4285594) (← links)
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs (Q5163156) (← links)