@article {IOPORT.01497278,
    author       = {Fron\v{c}ek, Dalibor},
    title        = {Note on cyclic decompositions of complete bipartite graphs into cubes.},
    year         = {1999},
    journal      = {Discussiones Mathematicae. Graph Theory},
    volume       = {19},
    number       = {2},
    issn         = {1234-3099},
    pages        = {219-227},
    publisher    = {University of Zielona G\'ora Press, Zielona G\'ora},
    doi          = {10.7151/dmgt.1096},
    abstract     = {Summary: So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes $Q_d$ of a given dimension $d$ was $K_{d2^{d- 1},d2^{d- 2}}$. We improve this result and show that also $K_{d2^{d- 2},d2^{d- 2}}$ allows a cyclic decomposition into $Q_d$. We also present a cyclic factorization of $K_{8,8}$ into $Q_4$.},
    identifier   = {01497278},
}