# Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

1 引文 斯高帕斯（Scopus）

## 摘要

In this paper, we give some necessary and sufficient conditions for decomposing the complete bipartite digraphs DKm,n and complete digraphs DKn into directed paths P→k+1 and directed cycles C→k with k arcs each. In particular, we prove that: (1) For any nonnegative integers p and q; and any positive integers m, n, and k with m≥k and n≥k; a decomposition of DKm,n into p copies of P→k+1 and q copies of (Formula presented.) exists if and only if k(p+q)=2mn, p≠1, (m,n,k,p)≠(2,2,2,3), and k is even when q>0. (2) For any nonnegative integers p and q and any positive integers n and k with k even and(Formula presented.), a decomposition of (Formula presented.) and q copies of (Formula presented.) exists if and only if k(p+q)=n(n-1) and p≠1. We also give necessary and sufficient conditions for such decompositions to exist when k=2 or 4.

原文 英語 1715-1725 11 Graphs and Combinatorics 31 5 https://doi.org/10.1007/s00373-014-1442-0 已發佈 - 2015 9月 24

• 理論電腦科學
• 離散數學和組合

## 指紋

深入研究「Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length」主題。共同形成了獨特的指紋。