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)
Δημοφιλείς αναρτήσεις
-
Abstract Background A reported penicillin allergy may compromise receipt of recommended antibiotic prophylaxis intended to prevent surgica...
-
Related Articles Feasibility of Brain Atrophy Measurement in Clinical Routine without Prior Standardization of the MRI Protocol:...
-
Rejuvenation Research , Vol. 0, No. 0. from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2EFILxo via I...
-
Letter to the editor of Acta Neurochirurgica: simultaneous pericranial and nasoseptal "double-flap" reconstruction after comb...
-
Abstract The core mission of the Early Stage Professionals in Molecular Imaging Sciences (ESPMIS) Interest Group is to help young scientist...
-
Adenylyl Cyclase-Associated Protein 1 in the Development of Head and Neck Squamous Cell Carcinomas. Bull Exp Biol Med. 2016 Mar 29; A...
-
In view of the performance requirements (e.g., ride comfort, road holding, and suspension space limitation) for vehicle suspension systems, ...
-
Ravikiran N Pawar, Sambhunath Banerjee, Subhajit Bramha, Shekhar Krishnan, Arpita Bhattacharya, Vaskar Saha, Anupam Chakrapani, Saurabh Bhav...
-
Purpose: This phase I study aimed to determine the recommended dose (RD), safety profile, and feasibility of a procedure combining intratum...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου