Symmetric edge-decompositions of hypercubes
From MaRDI portal
Publication:1175554
DOI10.1007/BF01789464zbMATH Open0756.05083OpenAlexW2031308285MaRDI QIDQ1175554FDOQ1175554
Authors: Mark Ramras 
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01789464
Recommendations
Hypergraphs (05C65) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- Packings of graphs and applications to computational complexity
- Packing a tree with a graph of the same size
- Title not available (Why is that?)
- Edge disjoint placement of graphs
- Tiling with polyominoes
- Decompositions of complete graphs into isomorphic cubes
- Every (p,p-2) graph is contained in its complement
- On the decomposition of n‐cubes into isomorphic trees
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Embedding (p,p - 1) graphs in their complements
- Isomorphic factorizations X: Unsolved problems
Cited In (11)
- Decomposition of hypercubes into sunlet graphs of order eight
- Decomposition of hypercube graphs into paths and cycles of length four
- Title not available (Why is that?)
- Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
- Packing the hypercube
- Title not available (Why is that?)
- Decomposition of hypercubes into regular connected bipancyclic subgraphs
- Title not available (Why is that?)
- 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)
