An improvement of Lichiardopol's theorem on disjoint cycles in tournaments

DOI10.1016/j.amc.2018.10.086zbMath1428.05124OpenAlexW2901440279MaRDI QIDQ2008499

Jin Yan, Fuhong Ma

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.10.086

zbMATH Keywords

tournamentsin-degreedisjoint cyclesout-degree

Mathematics Subject Classification ID

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

Related Items (3)

Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments

Cites Work

• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• 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
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• The confirmation of a conjecture on disjoint cycles in a graph
• Disjoint cycles of different lengths in graphs and digraphs
• Fan-type condition on disjoint cycles in a graph
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• On the number of disjoint 4-cycles in regular tournaments
• Disjoint cycles in graphs with distance degree sum conditions
• On vertex-disjoint cycles and degree sum conditions
• 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
• On the maximal number of independent circuits in a graph
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: An improvement of Lichiardopol's theorem on disjoint cycles in tournaments