Note on cyclic decompositions of complete bipartite graphs into cubes
Dalibor Fronček (1999)
Discussiones Mathematicae Graph Theory
Similarity:
So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes of a given dimension d was . We improve this result and show that also allows a cyclic decomposition into . We also present a cyclic factorization of into Q₄.