Advertisement

Decomposition of Complete Tripartite Graphs Into 5-Cycles

  • E. S. Mahmoodian
  • Maryam Mirzakhani
Part of the Mathematics and Its Applications book series (MAIA, volume 329)

Abstract

A result of Sotteau on the necessary and sufficient conditions for decomposing the complete bipartite graphs into even cycles has been shown in many occasions, that it is a very important tool in the theory of graph decomposition into even cycles. In order to have similar tools in the case of odd cycle decomposition, obviously bipartite graphs are not suitable to be considered. Searching for such tools, we have considered decomposition of complete tripartite graphs, K r,s,t , into 5-cycles. There are some necessary conditions that we have shown their sufficiency in the case of r = t, and some other cases. Our conjecture is that these conditions are always sufficient.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Rosa. O cyklických rozkladoch kompletného grafu na nepárnouholniky. Čas. Pěst. Mat, 91: 53–63, 1966.MathSciNetzbMATHGoogle Scholar
  2. [2]
    D. Sotteau. Decomposition of #(m, n) into cycles (circuits) of length 2k. J. of Combinatorial Theory B, 30: 75–81, 1981.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • E. S. Mahmoodian
    • 1
  • Maryam Mirzakhani
    • 1
  1. 1.Department of Mathematical SciencesSharif University of TechnologyTehranIran

Personalised recommendations