Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
Discussiones Mathematicae Graph Theory
Received 10.05.2017, Revised 07.12.2018, Accepted 07.12.2018, doi: 10.7151/dmgt.2197
Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, each of which has 4 edges.
complete graph, complete bipartite graph, path, star, cycle, decomposition