Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

DOI10.1137/20M1351047zbMath1460.05077MaRDI QIDQ5857005

Ngo Dac Tan

Publication date: 30 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

vertex disjoint cyclesstrong tournamentcycles of different lengthsstrong bipartite tournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments

Cites Work

• Unnamed Item
• Disjoint cycles in digraphs
• Graphs and digraphs with all 2-factors isomorphic
• Disjoint cycles of different lengths in graphs and digraphs
• Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
• On 3-regular digraphs of girth 4
• On 3-regular digraphs without vertex disjoint cycles of different lengths
• Disjoint cycles with different length in 4-arc-dominated digraphs
• On vertex disjoint cycles of different lengths in 3-regular digraphs
• Vertex Disjoint Cycles of Different Length in Digraphs
• Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
• Tournaments and Semicomplete Digraphs
• Semicomplete Multipartite Digraphs

This page was built for publication: Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths