Disjoint cycles in tournaments and bipartite tournaments

DOI10.1002/jgt.23038OpenAlexW4387389203MaRDI QIDQ6143388

Bin Chen, An Chang

Publication date: 24 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.23038

zbMATH Keywords

tournamentbipartite tournamentvertex disjoint cycle

Mathematics Subject Classification ID

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

Cites Work

• Vertex-disjoint cycles in regular tournaments
• Disjoint cycles in digraphs
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Disjoint directed cycles
• An improved bound for disjoint directed cycles
• Disjoint cycles of different lengths in graphs and digraphs
• On the number of disjoint 4-cycles in regular tournaments
• An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
• Vertex Disjoint Cycles of Different Length in Digraphs
• Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Digraphs
• On Subtournaments of a Tournament
• Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: Disjoint cycles in tournaments and bipartite tournaments