(C)over-right-arrow(4)-decompositions of D-vP and D-v boolean OR P where P is a 2-regular subgraph of D-v
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
525 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
515 | en_US |
dc.citation.volume |
22 | en_US |
dc.contributor.author |
Pu, Liqun | en_US |
dc.contributor.author |
Fu, Hung-Lin | en_US |
dc.contributor.author |
Shen, Hao | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:15:20Z | |
dc.date.available |
2014-12-08T15:15:20Z | |
dc.date.issued |
2006-12-01 | en_US |
dc.description.abstract |
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 D-vP and D-v boolean OR Pcan be decomposed into directed 4-cycles, respectively, if and only if v(v-1) - vertical bar E(P)vertical bar = 0 (mod 4) and v(v-1) + vertical bar E(P)vertical bar = 0 (mod 4) where vertical bar E(P)vertical bar denotes the number of directed edges of P, and v >= 8. | en_US |
dc.identifier.doi |
10.1007/s00373-006-0683-y | en_US |
dc.identifier.issn |
0911-0119 | en_US |
dc.identifier.journal |
GRAPHS AND COMBINATORICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s00373-006-0683-y | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11510 | |
dc.language.iso |
en_US | en_US |
dc.title |
(C)over-right-arrow(4)-decompositions of D-vP and D-v boolean OR P where P is a 2-regular subgraph of D-v | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文