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 Adult sagittal posture is established during childhood and adolescence. A flattened or hypercurved spine is associated with poore...
-
Objective Outpatient parenteral antimicrobial therapy (OPAT) provides opportunities for improved cost savings, but in the UK, implementation...
-
Abstract Purpose Overcoming the flaws of current data management conditions in head and neck oncology could enable integrated informatio...
-
CBN News Cancer Took Most of His Tongue, but This Pastor Is Still Singing ... CBN News A youth pastor in San Diego, California is not ...
-
Family: Know the drill New Straits Times Online One of my sons had this so often that his tonsils were removed. ... However, for som...
-
The E3 ubiquitin ligase F-box and WD repeat domain containing 7 (FBW7α) functions as a putative tumor suppressor in non-small cell lung canc...
-
In this study, the changes in pH, organic acid content, acidity, and salinity of kimchi prepared at 0 days, stored 1–8 weeks at 4 and 10°C, ...
-
When you make pizza this good you are allowed to brag about it. Come try a square of the best pizza in Erie. Ohhh yeah, we have ice cream no...
-
The March for Science reflects the growing gap between slow, steady, vital scientific gains and quick-fire, opportunist US politics, says D...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου