Decompositions of a complete multidigraph into almost arbitrary paths

DOI10.7151/DMGT.1622MaRDI QIDQ4647875zbMATH OpenOpenAlexFDO

Authors Mariusz Meszka, Zdzisław Skupień

Publication date 8 November 2012

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/31f6c254b18f2982c77f5aae92fd48f9a2bff62f

zbMATH Keywords

arbitrary path decompositioncomplete digraphmultidigraphtour girth

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decompositions of a complete multidigraph into nonhamiltonian paths
• scientific article; zbMATH DE number 5139445
• Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
• scientific article; zbMATH DE number 3943845
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths

Cited in

(8)

• Decompositions of digraphs into paths and cycles
• Decompositions of highly connected graphs into paths of any given length
• Decompositions of a complete multidigraph into nonhamiltonian paths
• scientific article; zbMATH DE number 5139445 (Why is no real title available?)
• Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
• Path decompositions of multigraphs
• scientific article; zbMATH DE number 5237268 (Why is no real title available?)
• scientific article; zbMATH DE number 2188371 (Why is no real title available?)

This page was built for publication: Decompositions of a complete multidigraph into almost arbitrary paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647875)