Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length

DOI10.1007/s00373-014-1442-0zbMath1327.05282OpenAlexW1977407093MaRDI QIDQ497372

Tay-Woei Shyu

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1442-0

zbMATH Keywords

decompositiondirected pathdirected cyclecomplete bipartite digraphcomplete digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each

Cites Work

• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of the complete directed graph into k-circuits
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Property testing and its connection to learning and approximation
• Decompositions of a complete multidigraph into nonhamiltonian paths
• Unnamed Item
• Unnamed Item
• Unnamed Item