Abstract
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.
Similar content being viewed by others
References
J.-C. Bermond: Cycles dans les graphes et G-configurations. Thesis, University of Paris XI (Orsay), Paris, 1975.
J. Bosák: Decompositions of Graphs. Kluwer, Dordrecht, Netherlands, 1990.
C. Huang: On Handcuffed designs. Dept. of C. and O. Research Report CORR75-10, University of Waterloo.
S. H. Y. Hung and N. S. Mendelsohn: Handcuffed designs. Discrete Math. 18 (1977), 23–33.
T.-W. Shyu: Path decompositions of λK n,n. Ars Comb. 85 (2007), 211–219.
M.-L. Yu: On path factorizations of complete multipartite graphs. Discrete Math. 122 (1993), 325–333.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lee, HC., Lin, C. Balanced path decomposition of λ K n,n and λ K * n,n . Czech Math J 59, 989–997 (2009). https://doi.org/10.1007/s10587-009-0068-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-009-0068-5