Vertex-disjoint cycles of different lengths in local tournaments
From MaRDI portal
Publication:6133661
DOI10.1007/s00373-023-02686-0zbMath1519.05093OpenAlexW4385606877MaRDI QIDQ6133661
Publication date: 21 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02686-0
Cites Work
- Unnamed Item
- Disjoint cycles in digraphs
- Graphs and digraphs with all 2-factors isomorphic
- Disjoint cycles of different lengths in graphs and digraphs
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
- Disjoint cycles of different lengths in 3-regular digraphs
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- On 3-regular digraphs of girth 4
- On 3-regular digraphs without vertex disjoint cycles of different lengths
- Disjoint cycles with different length in 4-arc-dominated digraphs
- On vertex disjoint cycles of different lengths in 3-regular digraphs
- Vertex Disjoint Cycles of Different Length in Digraphs
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- Tournaments and Semicomplete Digraphs
- Semicomplete Multipartite Digraphs
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
This page was built for publication: Vertex-disjoint cycles of different lengths in local tournaments