A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. A digraph is cycle complementary if there exist two vertex disjoint cycles and such that . Let be a locally almost regular -partite tournament with and such that all partite sets have the same cardinality , and let be a -cycle of . In this paper, we prove that if has no cycle factor, then contains a pair of disjoint cycles of length and , unless is isomorphic to , , , or .
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2aTopBa
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Objectives Greece is one of the leading tobacco-producing countries in European Union, and every year over 19 000 Greeks die from tobacco-at...
-
Objectives Drug interactions, poor adherence to medication and high-risk sexual behaviour may occur in individuals with HIV using recreation...
-
Abstract Background Mature T-cell and natural killer (NK)-cell lymphomas compose a heterogeneous group of non-Hodgkin lymphomas, and ext...
-
Introduction Multimorbidity (MM) refers to the coexistence of two or more chronic conditions within one person, where no one condition is co...
-
Objective To describe the prevalence and severity of diabetic retinopathy (DR) and sight-threatening DR (STDR) among Chinese adults with dia...
-
Related Articles Three job stress models and their relationship with musculoskeletal pain in blue- and white-collar workers. J Psycho...
-
<span class="paragraphSection"><div class="boxTitle">Abstract</div>Masked hypertension (MHT), defined ...
-
Background Hepatitis B virus (HBV) transmission is known to occur through direct contact with infected blood. There has been some suspicion ...
-
In Rwanda, the prevalence of viral hepatitis (HCV) is poorly understood. The current study investigated the prevalence and risk factors of H...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου