Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
From MaRDI portal
Publication:5857005
DOI10.1137/20M1351047zbMATH Open1460.05077MaRDI QIDQ5857005FDOQ5857005
Authors: Ngo Dac Tan 
Publication date: 30 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On vertex disjoint cycles of different lengths in 3-regular digraphs
- Vertex-disjoint cycles in bipartite tournaments
- Proof of a conjecture of Henning and yeo on vertex-disjoint directed cycles
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- Vertex-disjoint cycles in bipartite tournaments
Cites Work
- Title not available (Why is that?)
- Graphs and digraphs with all 2-factors isomorphic
- On 3-regular digraphs without vertex disjoint cycles of different lengths
- Disjoint cycles in digraphs
- Tournaments and Semicomplete Digraphs
- On 3-regular digraphs of girth 4
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- Disjoint cycles of different lengths in graphs and digraphs
- Vertex disjoint cycles of different length in digraphs
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
- Disjoint cycles with different length in 4-arc-dominated digraphs
- Semicomplete Multipartite Digraphs
- On vertex disjoint cycles of different lengths in 3-regular digraphs
Cited In (6)
- Disjoint cycles in tournaments and bipartite tournaments
- Vertex-disjoint cycles of different lengths in local tournaments
- Vertex-disjoint cycles in bipartite tournaments
- Vertex-disjoint rainbow cycles in edge-colored graphs
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- Title not available (Why is that?)
This page was built for publication: Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857005)
