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 Kenaf is a multipurpose crop, but a lack of genetic information hinders genetic and molecular research. In this study, we aimed t...
-
As demonstrated by the market reactions to downgrades of various sovereign credit ratings in 2011, the credit rating agencies occupy an impo...
-
Spindle cell/pleomorphic lipoma is an uncommonly encountered benign neoplasm that is usually found in the subcutaneous tissues. Rare cases r...
-
Lichtenstein intervention is currently the classic model of the regulated treatment of inguinal hernias by direct local approach. This “tens...
-
Publication date: Available online 10 February 2017 Source: International Journal of Oral and Maxillofacial Surgery Author(s): S. Sugiyama...
-
ORIGINAL ARTICLES Cyclooxygenase-2 and estrogen receptor-β as possible therapeutic targets in desmoid tumors p. 47 Rasha A Khairy DOI :10....
-
New magnetic resonance (MR) molecular imaging techniques offer the potential for non-invasive, simultaneous quantification of metabolic and ...
-
The parotid gland harbors 85% of all salivary gland neoplasms. Though the majority of tumors are benign, complete surgical resection remains...
-
Facial Nerve Clinic to Provide Comprehensive Personalized Care Newswise (press release) The program will treat patients with facial n...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου