ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 19(2) (1999) 219-227 DOI: 10.7151/dmgt.1096
Department of Applied Mathematics
Technical University Ostrava
17 listopadu, 708 33 Ostrava, Czech Republic
So far, the smallest complete bipartite graph which was known to have a cyclic
decomposition into cubes Qd of a given dimension d was Kd2d−1, d2d−2. We
improve this result and show that also Kd2d−2,
d2d−2 allows a cyclic decomposition into Qd.
We also present a cyclic factorization of K8,8 into Q4.
Keywords: hypercubes, bipartite graphs, factorization.
1991 Mathematics Subject Classification: 05C70.
Received 3 February 1999
Revised 30 October 1999