Open trails in digraphs

• Autorzy: Cichacz S. , Gorlich A.
• Języki publikacji: EN

Abstrakty

EN

It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph Ka,b, is decomposable into open trails of prescribed even lengths. In this article we consider the corresponding question for directed graphs. We show that the complete directed graphs ↔K n and ↔K a,b are arbitrarily decomposable into directed open trails.

Słowa kluczowe

EN

trail; graph decomposition; bipartite graph

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2011
• Tom: Vol. 31, no. 4
• Strony: 599--604
• Opis fizyczny: Bibliogr. 6 poz., rys.

Twórcy

autor

Cichacz S.

autor

Gorlich A.

• AGH University of Science and Technology Faculty of Applied Mathematics al. A. Mickiewicza 30, 30-059 Krakow, Poland,

Bibliografia

• [1] P.N. Balister, Packing circuits into KN, Combin. Probab. Comput. 10 (2001) 463–499.
• [2] P.N. Balister, Packing digraphs with directed closed trails, Combin. Probab. Comput. 12 (2003), 1–15.
• [3] S. Cichacz, Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails, Discussiones Mathematicae – Graph Theory 27 (2007) 2, 241–249.
• [4] S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022 (2006), http://www.ii.uj.edu.pl/preMD/.
• [5] M. Horňák, M. Woźniak, Decomposition of complete bipartite even graphs into closed trails, Czechoslovak Mathematical Journal 128 (2003), 127–134.
• [6] M. Meszka, Z. Skupień, Decompositions of a complete multidigraph into nonhamiltonian paths, J. Graph Theory 51 (2006), 82–91.