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)
Δημοφιλείς αναρτήσεις
-
from #Medicine-SfakianakisAlexandros via o.lakala70 on Inoreader https://ift.tt/2Gchesc via IFTTT
-
Abstract Determining the cause of unexplained death in all age groups, including infants, is a priority in forensic medicine. The triple r...
-
Abstract Layer-by-layer (LbL) dip coating, accompanying with the use of micelle structure, allows hydrophobic molecules to be coated on me...
-
from #Medicine-SfakianakisAlexandros via o.lakala70 on Inoreader https://ift.tt/2rxuJIO via IFTTT
-
from #Medicine-SfakianakisAlexandros via o.lakala70 on Inoreader https://ift.tt/2BeOBVJ via IFTTT
-
Abstract In this paper we present the study of a skull belonging to a young male from the Italian Bronze Age showing three perimortem inju...
-
Find out more about the wide range of A Levels and full time courses available at Longley Park Sixth Form College, the only independent Sixt...
-
Abstract To measure integral doses in image-guided radiation therapy, we developed an integral condenser dosimeter comprising a disposable...
-
Objectives. To assess the association between short-term postoperative cognitive dysfuction (POCD) and inflammtory response in patients unde...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου