… of representing complete tripartite graphs. This representation allows us to monitor trades
of sets of triangles and other edges with 5-cycles. In Section 4 we classify these trades into …

… to a set of triangles and edges in K(r, s, t) which can be decomposed into 5-cycles. … [3] to
decompose complete tripartite graphs into 5-cycles. Actually given a complete tripartite graph, it …

… in the case of odd cycle decomposition, obviously bipartite graphs are not suitable to be …
we have considered decomposition of complete tripartite graphs, K ..... t , into 5-cycles. There are …

… conditions for the decomposition of the complete tripartite graph K(r; s; t) into 5-cycles for
the … In Section 3 we show a way of representing a complete tripartite graph that allows us to …

… As mentioned in the previous section, in order to decompose K5r,5s,5t into 5-cycles, it is …
a complete tripartite graph K5r,5s,5t, then we can decompose Kr,s,t into triangles and 5-cycles. …

… The smallest example of a complete tripartite graph which satisfies the conditions of Theorem
1.1 and which has not yet been decomposed into 5-cycles is K(7, 17, 19). New techniques …

… deeper, decompose more tripartite graphs into 5-cycles, and introduce the Graph Adjacency
Matrix … In this section, we use the graph adjacency matrix to decompose tripartite graphs into …

… , On decomposing complete tripartite graphs into 5-cycles, … EJ Billington, Decomposing
complete tripartite graphs into … , Decomposing complete tripartite graphs into 5cycles when the …

… complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s
5-cycles… 1)/2 there is a decomposition of Kn into r 3-cycles and s 5-cycles which partition the …

… various results for 5-cycles. However, even when only two of the three partite sets have
the same size, the problem of decomposition into 5-cycles remains unsolved. Other known …