抄録
"A 2-fold graph is a graph with two edges in each adjacent vertices. 2Kp,q,r,s is a 2-fold complete 4-partite graph of order p, q, r, and s with four partite sets. Any two distinct vertices in 2Kp,q,r,s are joined with two edges if and only if thery belong to different parts. To decompose 2Kp,q,r,s into most cycles is the same as to decmpose it into as many small cycles (triangles) as possible. In this talk, I will present how to decompose a 2-fold complete 4-partite graph into as many cycles as possible."
