c-decompositions of Dv\P and Dv ∪ P where P is a 2-regular Subgraph of Dv

Liqun Pu*, Hung-Lin Fu, Hao Shen

*Corresponding author for this work

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

In this paper, we extend the study of C 4-decompositions of the complete graph with 2-regular leaves and paddings to directed versions. Mainly, we prove that if P is a vertex-disjoint union of directed cycles in a complete digraph D v , then [InlineMediaObject not available: see fulltext.] and D v ∪ P can be decomposed into directed 4-cycles, respectively, if and only if v(v-1)-|E(P)|≡0(mod 4) and v(v-1)+|E(P)|≡0(mod 4) where |E(P)| denotes the number of directed edges of P, and v≥8.

原文English
頁(從 - 到)515-525
頁數11
期刊Graphs and Combinatorics
22
發行號4
DOIs
出版狀態Published - 1 十二月 2006

指紋 深入研究「<sup>⇀</sup>c-decompositions of D<sub>v</sub>\P and D<sub>v</sub> ∪ P where P is a 2-regular Subgraph of D<sub>v</sub>」主題。共同形成了獨特的指紋。

引用此