Locally semicomplete digraphs that are complementarym-pancyclic

✍ Scribed by Guo, Yubao; Volkmann, Lutz

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 923 KB
• Volume: 21
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199602)21:2<121::aid-jgt2>3.0.co;2-t

✦ Synopsis

If A and Bare two subdigraphs of D, then we denote by &(A, 5) the distance between A and 5. Let D be a 2-connected locally semicomplete digraph on n 2 6 vertices. If S is a minimum separating set of D and d = min{do-s(N+(s) -S, N-(s) -S ) l s E S}, then rn = max(3, d + 2) I n/2 and D contains t w o vertex-disjoint dicycles of lengths t and nt for every integer t satisfying rn I t I n/2, unless D is a member of a family of locally semicomplete digraphs. This result extends those of Reid (Ann. Discrete