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 q- dimensional hypercubes Qq various researchers have done this for cer- tain trees, paths, and cycles. In this paper we shall say that "H divides G" if E(G) is the disjoint union of fE(Hi)|HisimeqH. Our main result is that for q odd and q<232, the path of length m, Pm, divides Qq if and only if mleqq and m|(qimes2q1).











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)