(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

檔案

本條目沒有附加檔案。

日期

2006-12-01

期刊名稱

GRAPHS AND COMBINATORICS

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料