Decomposition of product graphs into complete bipartite subgraphs (Q1073047): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5663904 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new proof of a theorem of Graham and Pollak / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the decomposition ofkn into complete bipartite graphs / rank | |||
Normal rank | |||
Latest revision as of 12:22, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of product graphs into complete bipartite subgraphs |
scientific article |
Statements
Decomposition of product graphs into complete bipartite subgraphs (English)
0 references
1985
0 references
edge-partition
0 references
graph decomposition
0 references
complete bipartite subgraphs
0 references
