It has been shown [3] that any bipartite graph , where a, b are even integers, can be decomposed into closed trails with prescribed even lengths. In this article, we consider the corresponding question for directed bipartite graphs. We show that a complete directed bipartite graph is decomposable into directed closed trails of even lengths greater than 2, whenever these lengths sum up to the size of the digraph. We use this result to prove that complete bipartite multigraphs can be decomposed in a similar manner.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1358,
author = {Sylwia Cichacz},
title = {Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails},
journal = {Discussiones Mathematicae Graph Theory},
volume = {27},
year = {2007},
pages = {241-249},
zbl = {1133.05075},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1358}
}
Sylwia Cichacz. Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails. Discussiones Mathematicae Graph Theory, Tome 27 (2007) pp. 241-249. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1358/
[000] [1] P.N. Balister, Packing Circuits into Kₙ, Combin. Probab. Comput. 10 (2001) 463-499, doi: 10.1017/S0963548301004771. | Zbl 1113.05309
[001] [2] P.N. Balister, Packing digraphs with directed closed trails, Combin. Probab. Comput. 12 (2003) 1-15, doi: 10.1017/S0963548302005461. | Zbl 1015.05072
[002] [3] M. Hornák and M. Woźniak, Decomposition of complete bipartite even graphs into closed trails, Czechoslovak Math. J. 128 (2003) 127-134. | Zbl 1010.05054