Previous |  Up |  Next

Article

Title: Balanced path decomposition of $\lambda K_{n,n}$ and $\lambda K^*_{n,n}$ (English)
Author: Lee, Hung-Chih
Author: Lin, Chiang
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 59
Issue: 4
Year: 2009
Pages: 989-997
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: path decomposition
Keyword: balanced decomposition
Keyword: complete bipartite graph
MSC: 05C38
MSC: 05C70
idZBL: Zbl 1224.05261
idMR: MR2563571
.
Date available: 2010-07-20T15:52:27Z
Last updated: 2020-07-03
Stable URL: http://hdl.handle.net/10338.dmlcz/140530
.
Reference: [1] Bermond, J.-C.: Cycles dans les graphes et $G$-configurations.Thesis, University of Paris XI (Orsay), Paris (1975).
Reference: [2] Bosák, J.: Decompositions of Graphs.Kluwer, Dordrecht, Netherlands (1990). MR 1071373
Reference: [3] Huang, C.: On Handcuffed designs.Dept. of C. and O. Research Report CORR75-10, University of Waterloo.
Reference: [4] Hung, S. H. Y., Mendelsohn, N. S.: Handcuffed designs.Discrete Math. 18 (1977), 23-33. Zbl 0354.05016, MR 0447002, 10.1016/0012-365X(77)90003-6
Reference: [5] Shyu, T.-W.: Path decompositions of $łK_{n,n}$.Ars Comb. 85 (2007), 211-219. MR 2359292
Reference: [6] Yu, M.-L.: On path factorizations of complete multipartite graphs.Discrete Math. 122 (1993), 325-333. Zbl 0792.05114, MR 1246687, 10.1016/0012-365X(93)90305-D
.

Files

Files Size Format View
CzechMathJ_59-2009-4_9.pdf 256.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo