Vertex-disjoint cycles of different lengths in multipartite tournaments

Vertex-disjoint cycles of different lengths in multipartite tournaments

We show in this paper that every strong k-partite tournament D=(V,A) with k≥3 and minimum out-degree 3, except the digraphs D73 and D83 which are defined in the introduction of this paper, contains two vertex-disjoint directed cycles of different lengths.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2022-06, Vol.345 (6), p.112819, Article 112819
Hauptverfasser: Hung, Le Xuan, Hieu, Do Duy, Tan, Ngo Dac
Format: Artikel
Sprache:eng
Schlagworte:
Cycles of different lengths
k-partite tournament
Strong digraph
Vertex-disjoint cycles
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show in this paper that every strong k-partite tournament D=(V,A) with k≥3 and minimum out-degree 3, except the digraphs D73 and D83 which are defined in the introduction of this paper, contains two vertex-disjoint directed cycles of different lengths.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2022.112819