On the connectivity of close to regular multipartite tournaments
From MaRDI portal
Publication:2492221
DOI10.1016/j.dam.2004.09.022zbMath1099.05053OpenAlexW1997822764MaRDI QIDQ2492221
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.09.022
Related Items (3)
Multipartite tournaments: a survey ⋮ Complementary cycles in regular multipartite tournaments, where one cycle has length five ⋮ Semicomplete Multipartite Digraphs
Cites Work
- Hamiltonian-connected tournaments
- Cycles in multipartite tournaments: Results and problems
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- 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
- Unnamed Item
This page was built for publication: On the connectivity of close to regular multipartite tournaments