{Ck, Pk, Sk} Decompositions of Balanced Complete Bipartite Multigraphs

Foregger [11] guaranteed such a decomposition for the Cartesian product of three cycles while Aubert and Schneider [2] generalised this result for the Cartesian product of a

Fu, (4, 5)-Cycle systems of complete multipartite graphs, Taiwanese J. Morris, Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor, Discrete Math.

Decompositions of the complete k-uniform hypergraph into hamiltonian cycles were considered in [11, 13], where a complete solution was given in [11] for k ≥ 4 and n ≥ 30 and

In Section 3 we focus on the Grundy colorings of some central classical graphs (complete graphs, complete bipartite graphs, complete k-ary trees, paths and cycles) for which

Ramras, Edge decompositions of hypercubes by paths and by cycles, Graphs Combin., publ. Ramras, Symmetric edge decompositions of hypercubes,

We then show how these k-extended Skolem- type difference sets can be used to find decompositions of circulant and complete graphs of order n into 5-cycles, d-cycles, where d is a

In these cases the graphs being decomposed are, respectively, complete graphs (of necessarily odd order), complete graphs of even order minus a 1-factor and 2-fold

Among graphs arbitrarily decomposable into closed trails there are also complete bipartite graphs K a,b for a, b even (see Horˇn´ak and Wo´zniak [9]), complete tripartite graphs K