Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 715-731

Voir la notice de l'article provenant de la source Library of Science

We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph K_m,n ( λ ) into paths and cycles having k edges. In particular, we show that such decomposition exists in K_m,n ( λ ), when λ≡ 0 (mod 2), m,n ≥ k/2, m+n gt; k and k(p + q) = 2mn for k ≡ 0 (mod 2) and also when λ≥ 3, λ m ≡λ n ≡ 0(mod 2), k(p + q) =λ m n, m, n ≥ k, (resp., m, n ≥ 3k//2) for k ≡ 0(mod 4) (respectively, for k ≡ 2(mod 4)). In fact, the necessary conditions given above are also sufficient when λ = 2.
Keywords: path, cycle, graph decomposition, multigraph
@article{DMGT_2015_35_4_a9,
     author = {Jeevadoss, Shanmugasundaram and Muthusamy, Appu},
     title = {Decomposition of {Complete} {Bipartite} {Multigraphs} {Into} {Paths} and {Cycles} {Having} $k$ {Edges}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {715--731},
     publisher = {mathdoc},
     volume = {35},
     number = {4},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a9/}
}
TY  - JOUR
AU  - Jeevadoss, Shanmugasundaram
AU  - Muthusamy, Appu
TI  - Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2015
SP  - 715
EP  - 731
VL  - 35
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a9/
LA  - en
ID  - DMGT_2015_35_4_a9
ER  - 
%0 Journal Article
%A Jeevadoss, Shanmugasundaram
%A Muthusamy, Appu
%T Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges
%J Discussiones Mathematicae. Graph Theory
%D 2015
%P 715-731
%V 35
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a9/
%G en
%F DMGT_2015_35_4_a9
Jeevadoss, Shanmugasundaram; Muthusamy, Appu. Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 715-731. http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a9/