Longest cycles in almost regular 3-partite tournaments
From MaRDI portal
Publication:860458
DOI10.1016/j.disc.2006.04.030zbMath1111.05042OpenAlexW2070405536MaRDI QIDQ860458
Publication date: 9 January 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.030
Related Items (2)
Cites Work
- Cycles in multipartite tournaments: Results and problems
- On cycles through a given vertex in multipartite tournaments
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- One-diregular subgraphs in semicomplete multipartite digraphs
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Kings in semicomplete multipartite digraphs
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- Unnamed Item
- Unnamed Item
This page was built for publication: Longest cycles in almost regular 3-partite tournaments