Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree

Cycles in digraphs– a survey

J.-C. Bermond, Carsten Thomassen · Journal of Graph Theory · 1981 · 198 citations · Full text

Natural Sciences, Computer Science, Mathematics +9

Disjoint cycles in digraphs

Carsten Thomassen · COMBINATORICA · 1983 · 78 citations

Natural Sciences, Computer Systems, Combinatorics +6

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

Nicolas Lichiardopol, Attila Pór, Jean‐Sébastien Sereni · SIAM Journal on Discrete Mathematics · 2009 · 37 citations

Natural Sciences, Mathematics, Combinatorics +7

Partitioning Vertices of a Tournament into Independent Cycles

Guantao Chen, Ronald J. Gould, Hao Li · Journal of Combinatorial Theory Series B · 2001 · 29 citations

Natural Sciences, Evolutionary Biology, Combinatorics +4

The partition of a strong tournament

Hao Li, Jinlong Shu · Discrete Mathematics · 2005 · 12 citations

Natural Sciences, Decision Sciences, Combinatorics +3