Paths with a given number of vertices from each partite set in regular multipartite tournaments
From MaRDI portal
Publication:2433729
DOI10.1016/j.disc.2006.04.029zbMath1103.05043OpenAlexW2009246799MaRDI QIDQ2433729
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.029
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in bipartite tournaments
- Cycles in multipartite tournaments
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- One-diregular subgraphs in semicomplete multipartite digraphs
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Kings in semicomplete multipartite digraphs
- On Subtournaments of a Tournament
This page was built for publication: Paths with a given number of vertices from each partite set in regular multipartite tournaments