Vertex disjoint 4-cycles in bipartite tournaments

DOI10.1016/j.disc.2017.10.023zbMath1380.05084OpenAlexW2770134917MaRDI QIDQ1699558

Diego González-Moreno, Camino Balbuena, Mika Olsen

Publication date: 23 February 2018

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

Full work available at URL: http://hdl.handle.net/2117/111583

zbMATH Keywords

vertex-disjoint cyclesbipartite tournamentminimum outdegreeprescribed lengthBermond-Thomassen conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Vertex-disjoint cycles in local tournaments ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments

Cites Work

• Disjoint cycles in digraphs
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• 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
• Vertex-disjoint cycles in bipartite tournaments

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