Open AccessNote on cyclic decompositions of complete bipartite graphs into cubes
Author(s) -
Dalibor Fronček
Publication year - 1999
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1096
Subject(s) - mathematics , bipartite graph , combinatorics , cograph , complete bipartite graph , discrete mathematics , chordal graph , 1 planar graph , graph
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom