Vertex-disjoint cycles in bipartite tournaments

DOI10.1016/j.disc.2015.02.012zbMath1310.05105OpenAlexW2050644972MaRDI QIDQ5919730

Hao Li, Bin Long Li, Yan Dong Bai

Publication date: 29 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.02.012

zbMATH Keywords

vertex-disjoint cyclesbipartite tournamentminimum outdegreeprescribed lengthBermond-Thomassen conjecture

Mathematics Subject Classification ID

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

Related Items (11)

On disjoint cycles of the same length in tournaments ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Vertex disjoint 4-cycles in bipartite tournaments ⋮ On the number of disjoint 4-cycles in regular tournaments ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ Disjoint properly colored cycles in edge-colored complete bipartite graphs

Cites Work

• 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
• Cycles in bipartite tournaments
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• Long paths and cycles in oriented graphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments

This page was built for publication: Vertex-disjoint cycles in bipartite tournaments