Symmetric edge-decompositions of hypercubes
From MaRDI portal
Publication:1175554
DOI10.1007/BF01789464zbMath0756.05083OpenAlexW2031308285MaRDI QIDQ1175554
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
Hypergraphs (05C65) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Related Items (9)
Unnamed Item ⋮ Decomposition of hypercubes into regular connected bipancyclic subgraphs ⋮ Decomposing hypercubes into regular connected subgraphs ⋮ Decomposition of hypercube graphs into paths and cycles of length four ⋮ Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees ⋮ Symmetric vertex partitions of hypercubes by isometric trees ⋮ Packing the hypercube ⋮ Edge decompositions of hypercubes by paths and by cycles ⋮ Decomposition of hypercubes into sunlet graphs of order eight
Cites Work
- Unnamed Item
- Edge disjoint placement of graphs
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Decompositions of complete graphs into isomorphic cubes
- Embedding (p,p - 1) graphs in their complements
- Packings of graphs and applications to computational complexity
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
- Packing a tree with a graph of the same size
- Every (p,p-2) graph is contained in its complement
- On the decomposition of n‐cubes into isomorphic trees
- Isomorphic factorizations X: Unsolved problems
- Tiling with polyominoes
This page was built for publication: Symmetric edge-decompositions of hypercubes