Vertex‐disjoint cycles of the same length in tournaments

DOI10.1002/jgt.22892OpenAlexW4297879381MaRDI QIDQ6094042

Zhi Lan Wang, Jin Yan, Yuzhen Qi

Publication date: 9 October 2023

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

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

zbMATH Keywords

tournamentdisjoint cyclesminimum outdegree

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial and computational aspects of graph packing and graph decomposition
• Disjoint cycles in digraphs
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• Triangle packings and 1-factors in oriented graphs
• Disjoint directed cycles
• An improved bound for disjoint directed cycles
• Disjoint cycles of different lengths in graphs and digraphs
• An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
• On disjoint cycles of the same length in tournaments
• Lichiardopol's conjecture on disjoint cycles in tournaments
• Cyclic triangle factors in regular 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

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