On the decomposition of n‐cubes into isomorphic trees
From MaRDI portal
Publication:4713098
DOI10.1002/jgt.3190140403zbMath0735.05063OpenAlexW2123599218WikidataQ126254326 ScholiaQ126254326MaRDI QIDQ4713098
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140403
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (15)
Decomposing 8-regular graphs into paths of length 4 ⋮ Decomposing hypercubes into regular connected subgraphs ⋮ \(\alpha\)-labeling number of trees ⋮ New families of graphs that have \(\alpha\)-labelings ⋮ Decomposing 10-regular graphs into paths of length 5 ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees ⋮ Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube ⋮ Symmetric vertex partitions of hypercubes by isometric trees ⋮ Symmetric edge-decompositions of hypercubes ⋮ Packing the hypercube ⋮ Long path and cycle decompositions of even hypercubes ⋮ Decomposing the cube into paths ⋮ Edge decompositions of hypercubes by paths and by cycles ⋮ Decomposition of hypercubes into sunlet graphs of order eight
This page was built for publication: On the decomposition of n‐cubes into isomorphic trees
