Decomposing Complete Equipartite Graphs into Short Odd Cycles
Keyword(s):
In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both odd and short relative to the number of parts.
2016 ◽
Vol 2016
◽
pp. 1-4
◽
1986 ◽
Vol 23
(04)
◽
pp. 851-858
◽
1991 ◽
Vol 11
(1)
◽
pp. 65-71
◽