Pages that link to "Item:Q1584282"
From MaRDI portal
The following pages link to On embedding complete graphs into hypercubes (Q1584282):
Displaying 5 items.
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
