Vertex-disjoint cycles of different lengths in tournaments of cycles
Vertex-disjoint cycles of different lengths in tournaments of cycles
Сибирские электронные математические известия, 22, № 1, стр. 46-53 (2024)
Аннотация:
We show in this paper that every tournament of $k$ cycles $D=(V,A)$ with $k\ge 2$ and minimum out-degree 3, except the digraph $D^3_8$, contains two disjoint cycles of different lengths.
Ключевые слова: digraph, tournament of cycles, vertex-disjoint cycles, cycles of different lengths.