Edge decompositions of hypercubes by paths and by cycles

DOI10.1007/s00373-013-1402-0zbMath1312.05075arXiv1205.4161OpenAlexW1972251369MaRDI QIDQ2345537

Michel Mollard, Mark Ramras

Publication date: 22 May 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.4161

zbMATH Keywords

pathhypercubesHamiltonian cycleedge decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Unnamed Item ⋮ Decomposition of hypercubes into regular connected bipancyclic subgraphs ⋮ Decomposition of hypercube graphs into paths and cycles of length four ⋮ Decomposing the cube into paths ⋮ Decomposition of hypercubes into sunlet graphs of order eight

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
• Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
• Symmetric edge-decompositions of hypercubes
• Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
• On the decomposition of n‐cubes into isomorphic trees
• Star decompositions of cubes

This page was built for publication: Edge decompositions of hypercubes by paths and by cycles