Packing the hypercube

DOI10.7151/dmgt.1712zbMath1285.05149OpenAlexW2088218098MaRDI QIDQ5405279

David Offner

Publication date: 2 April 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1712

zbMATH Keywords

hypercubedecompositionpacking

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Partitioning the vertices of a torus into isomorphic subgraphs, Long path and cycle decompositions of even hypercubes

Cites Work

• Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
• Packing lines in a hypercube
• Symmetric vertex partitions of hypercubes by isometric trees
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• A survey of the theory of hypercube graphs
• Fixed hypercube embedding
• Symmetric edge-decompositions of hypercubes
• On cubical graphs
• On edge-disjoint spanning trees in hypercubes
• Distance-preserving subgraphs of hypercubes
• Hamming Codes, Hypercube Embeddings, and Fault Tolerance
• On the decomposition of n‐cubes into isomorphic trees
• On the spanning tree packing number of a graph: A survey
• Star decompositions of cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item