On embedding complete graphs into hypercubes

DOI10.1016/S0012-365X(97)00239-2zbMath0956.05035OpenAlexW2075418359MaRDI QIDQ1584282

Alexander Russell, Ravi Sundaram, Michael Klugerman

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00239-2

zbMATH Keywords

hypercubeembeddingdistance

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ A bound on the total size of a cut cover ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ Exact wirelength of hypercubes on a grid

Cites Work

• An ``average distance inequality for large subsets of the cube
• The Complexity of Multiterminal Cuts