Displaying similar documents to “Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges”

Balanced path decomposition of λ K n , n and λ K n , n *

Hung-Chih Lee, Chiang Lin (2009)

Czechoslovak Mathematical Journal

Similarity:

Let P k denote a path with k edges and ł K n , n denote the ł -fold complete bipartite graph with both parts of size n . In this paper, we obtain the necessary and sufficient conditions for ł K n , n to have a balanced P k -decomposition. We also obtain the directed version of this result.

On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges

Atif A. Abueida, Chester Lian (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let Cm and Sm denote a cycle and a star on m edges, respectively. We investigate the decomposition of the complete graphs, Kn, into cycles and stars on the same number of edges. We give an algorithm that determines values of n, for a given value of m, where Kn is {Cm, Sm}-decomposable. We show that the obvious necessary condition is sufficient for such decompositions to exist for different values of m.