TY - JOUR
A2 - Kavun, Sergii V.
AU - He, Zhihong
AU - Wang, Xiaoying
AU - Zhang, Caiming
PY - 2016
DA - 2016/08/15
TI - Complementary Cycles in Irregular Multipartite Tournaments
SP - 5384190
VL - 2016
AB - A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. A digraph D is cycle complementary if there exist two vertex disjoint cycles C and C′ such that V(D)=V(C)∪V(C′). Let D be a locally almost regular c-partite tournament with c≥3 and |γ(D)|≤3 such that all partite sets have the same cardinality r, and let C3 be a 3-cycle of D. In this paper, we prove that if D-V(C3) has no cycle factor, then D contains a pair of disjoint cycles of length 3 and |V(D)|-3, unless D is isomorphic to T7, D4,2, D4,2⁎, or D3,2.
SN - 1024-123X
UR - https://doi.org/10.1155/2016/5384190
DO - 10.1155/2016/5384190
JF - Mathematical Problems in Engineering
PB - Hindawi Publishing Corporation
KW -
ER -