Strongly 4-path-connectivity in almost regular multipartite tournaments
From MaRDI portal
Publication:2463909
DOI10.1016/j.disc.2007.03.048zbMath1131.05047MaRDI QIDQ2463909
Lutz Volkmann, Stefan Winzen, Irene Stella
Publication date: 6 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.048
Related Items
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?
- Bypasses in asymmetric digraphs
- Cycles of Each Length in Regular Tournaments
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item