Recommendations
Cites work
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- Decompositions of complete graphs into isomorphic cubes
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Every (p,p-2) graph is contained in its complement
- Isomorphic factorizations X: Unsolved problems
- On the decomposition of n‐cubes into isomorphic trees
- Packing a tree with a graph of the same size
- Packings of graphs and applications to computational complexity
- Tiling with polyominoes
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
Cited in
(12)- Decomposition of hypercubes into sunlet graphs of order eight
- Decomposition of hypercube graphs into paths and cycles of length four
- Cycle decompositions of the Cartesian product of cycles
- scientific article; zbMATH DE number 1409198 (Why is no real title available?)
- Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees
- Packing the hypercube
- Transitive decompositions of hypercubes \(Q_n\)
- scientific article; zbMATH DE number 812079 (Why is no real title available?)
- Decomposition of hypercubes into regular connected bipancyclic subgraphs
- Symmetric vertex partitions of hypercubes by isometric trees
- Edge decompositions of hypercubes by paths and by cycles
- Decomposing hypercubes into regular connected subgraphs
This page was built for publication: Symmetric edge-decompositions of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175554)
