Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
From MaRDI portal
Publication:4435328
DOI10.7155/jgaa.00061zbMath1027.05077OpenAlexW4252973942WikidataQ114012046 ScholiaQ114012046MaRDI QIDQ4435328
Douglas W. Bass, Ivan Hal Sudborough
Publication date: 30 November 2003
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/50433
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Unnamed Item ⋮ Decomposition of hypercubes into regular connected bipancyclic subgraphs ⋮ Decomposing hypercubes into regular connected subgraphs ⋮ Factorizations of the product of cycles ⋮ Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube ⋮ Long path and cycle decompositions of even hypercubes
This page was built for publication: Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
