On embedding complete graphs into hypercubes (Q1584282): 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: An ``average distance'' inequality for large subsets of the cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Multiterminal Cuts / rank | |||
Normal rank | |||
Latest revision as of 17:04, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On embedding complete graphs into hypercubes |
scientific article |
Statements
On embedding complete graphs into hypercubes (English)
0 references
2 November 2000
0 references
embedding
0 references
hypercube
0 references
distance
0 references
