On disjoint cycles of the same length in tournaments

DOI10.1007/s10255-022-1072-xzbMath1486.05121OpenAlexW4226238319MaRDI QIDQ2125644

Yun Wang, Jin Yan, Shuo Zhu

Publication date: 14 April 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1072-x

zbMATH Keywords

tournamentsdisjoint cyclesminimum out-degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Vertex‐disjoint cycles of the same length in tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS
• Disjoint cycles in digraphs
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• Disjoint directed cycles
• Application of a novel nonlinear multivariate grey Bernoulli model to predict the tourist income of China
• An improved bound for disjoint directed cycles
• On the number of disjoint 4-cycles in regular tournaments
• Partitioning vertices of a tournament into independent cycles
• Lichiardopol's conjecture on disjoint cycles in tournaments
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• On the Number of Vertex-Disjoint Cycles in Digraphs
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Digraphs
• On Subtournaments of a Tournament
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: On disjoint cycles of the same length in tournaments