Decompositions of a complete multidigraph into almost arbitrary paths
Mariusz Meszka ; Zdzisław Skupień
Discussiones Mathematicae Graph Theory, Tome 32 (2012), p. 357-372 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

For n ≥ 4, the complete n-vertex multidigraph with arc multiplicity λ is proved to have a decomposition into directed paths of arbitrarily prescribed lengths ≤ n - 1 and different from n - 2, unless n = 5, λ = 1, and all lengths are to be n - 1 = 4. For λ = 1, a more general decomposition exists; namely, up to five paths of length n - 2 can also be prescribed.

Publié le : 2012-01-01
EUDML-ID : urn:eudml:doc:270814 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1622,
     author = {Mariusz Meszka and Zdzis\l aw Skupie\'n},
     title = {Decompositions of a complete multidigraph into almost arbitrary paths},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {32},
     year = {2012},
     pages = {357-372},
     zbl = {1255.05089},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1622}
}

Mariusz Meszka; Zdzisław Skupień. Decompositions of a complete multidigraph into almost arbitrary paths. Discussiones Mathematicae Graph Theory, Tome 32 (2012) pp. 357-372. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1622/

[000] [1] C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam-London, 1973).

[001] [2] J.-C. Bermond and V. Faber, Decomposition of the complete directed graph into k-circuits, J. Combin. Theory (B) 21 (1976) 146-155, doi: 10.1016/0095-8956(76)90055-1. | Zbl 0344.05123

[002] [3] J. Bosák, Decompositions of Graphs (Dordrecht, Kluwer, 1990).

[003] [4] G. Chartrand and L. Lesniak, Graphs and Digraphs (Chapman & Hall/CRC Boca Raton, 2004). | Zbl 0890.05001

[004] [5] N.S. Mendelsohn, Hamiltonian decomposition of the complete directed n-graph, in: Theory of Graphs, Proc. Colloq., Tihany 1966, P. Erdös and G. Katona (Eds.), (Akadémiai Kiadó, Budapest, 1968) 237-241.

[005] [6] M. Meszka and Z. Skupień, Decompositions of a complete multidigraph into nonhamiltonian paths, J. Graph Theory 51 (2006) 82-91, doi: 10.1002/jgt.20122. | Zbl 1084.05054

[006] [7] M. Meszka and Z. Skupień, Long paths decompositions of a complete digraph of odd order, Congr. Numer. 183 (2006) 203-211.

[007] [8] M. Tarsi, Decomposition of a complete multigraph into simple paths: Nonbalanced handcuffed designs, J. Combin. Theory (A) 34 (1983) 60-70, doi: 10.1016/0097-3165(83)90040-7. | Zbl 0511.05024

[008] [9] T. Tillson, A Hamiltonian decomposition of K*2m, 2m ≥ 8, J. Combin. Theory (B) 29 (1980) 68-74, doi: 10.1016/0095-8956(80)90044-1.