Pages that link to "Item:Q789411"
From MaRDI portal
The following pages link to A new proof of a theorem of Graham and Pollak (Q789411):
Displayed 16 items.
- On biclique partitions of the complete graph (Q686164) (← links)
- On decompositions of complete hypergraphs (Q1040837) (← links)
- Decomposition of product graphs into complete bipartite subgraphs (Q1073047) (← links)
- Clique partitions of the cocktail party graph (Q1076691) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On tournament matrices (Q1183197) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs (Q1392568) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- A polynomial space proof of the Graham-Pollak theorem (Q2427560) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)