Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees

DOI10.1016/j.disc.2012.01.033zbMath1242.05225OpenAlexW2154900392MaRDI QIDQ418894

Marcel Wild, Stephan G. Wagner

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.033

zbMATH Keywords

hypercubedecompositionisomorphic trees

Mathematics Subject Classification ID

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

Related Items (6)

Decomposition of hypercubes into regular connected bipancyclic subgraphs ⋮ Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes ⋮ Packing the hypercube ⋮ Decomposing the cube into paths ⋮ Component Edge Connectivity of Hypercubes ⋮ Edge decompositions of hypercubes by paths and by cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric edge-decompositions of hypercubes
• Cover-preserving order embeddings into Boolean lattices
• On edge-disjoint spanning trees in hypercubes
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• On the decomposition of n‐cubes into isomorphic trees
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees