Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths
暂无分享,去创建一个
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λK m,n * and a complete bipartite multigraph λK m,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.
[1] John Frederick Fink,et al. A note on path-perfect graphs , 1981, Discret. Math..
[2] J. Bermond,et al. Graph decompositions and G-designs , 1976 .
[3] MICHAEL TARSI. Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs , 1983, J. Comb. Theory, Ser. A.
[4] R. Graham,et al. Combinatorics: Recent results in graph decompositions , 1981 .