Edge decompositions of hypercubes by paths
From MaRDI portal
Abstract: Many authors have investigated edge decompositions of graphs by the edge sets of isomorphic copies of special subgraphs. For - dimensional hypercubes various researchers have done this for cer- tain trees, paths, and cycles. In this paper we shall say that " divides " if is the disjoint union of . Our main result is that for odd and , the path of length , , divides if and only if and .
Recommendations
Cited in
(12)- Symmetric edge-decompositions of hypercubes
- Long path and cycle decompositions of even hypercubes
- Partitioning the vertices of a torus into isomorphic subgraphs
- Edge decompositions of hypercubes by paths and by cycles
- scientific article; zbMATH DE number 4181376 (Why is no real title available?)
- Decomposition of hypercube graphs into paths and cycles of length four
- Decomposing complete graphs into cubes
- Decomposition of hypercubes into sunlet graphs of order eight
- Multidecomposition of hypercube graphs into paths, cycles and stars
- Decomposition of hypercube graphs into paths and cycles having k edges
- Decomposition of hypercubes into sunlet graphs
- Decomposing the cube into paths
This page was built for publication: Edge decompositions of hypercubes by paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245542)