Get access

On Cyclic Decompositions of Complete Graphs into Tripartite Graphs


  • Contract grant sponsor: National Science Foundation; Contract grant number: A0649210.


We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic G-decomposition of inline image for every positive integer x. We also show that if G is the union of two vertext-disjoint cycles of odd length, other than inline image, then G admits one of these labelings.

Get access to the full text of this article