Vertex-disjoint cycles in bipartite tournaments
From MaRDI portal
Publication:5892296
DOI10.1016/j.endm.2016.09.013zbMath1356.05059OpenAlexW2535689316MaRDI QIDQ5892296
Mika Olsen, Diego González-Moreno, Camino Balbuena
Publication date: 13 February 2017
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/111583
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
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
- Vertex-disjoint cycles in bipartite tournaments
This page was built for publication: Vertex-disjoint cycles in bipartite tournaments
