Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees

DOI10.1016/J.DISC.2012.01.033zbMATH Open1242.05225OpenAlexW2154900392MaRDI QIDQ418894FDOQ418894

Authors: Marcel Wild, Stephan 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

decompositionhypercubeisomorphic trees

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On edge-disjoint spanning trees in hypercubes
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Symmetric edge-decompositions of hypercubes
• Cover-preserving order embeddings into Boolean lattices
• On the decomposition of n‐cubes into isomorphic trees
• Title not available (Why is that?)
• On the spanning tree packing number of a graph: A survey

Cited In (8)

• On the decomposition of n‐cubes into isomorphic trees
• Packing the hypercube
• Decomposing the cube into paths
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• Component Edge Connectivity of Hypercubes
• Decomposition of hypercubes into regular connected bipancyclic subgraphs
• Edge decompositions of hypercubes by paths and by cycles
• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418894)