When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
From MaRDI portal
Publication:1763349
DOI10.1016/j.disc.2004.10.007zbMath1055.05070OpenAlexW1968553077MaRDI QIDQ1763349
Publication date: 22 February 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.007
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Longest paths in semicomplete multipartite digraphs
- Cycles in multipartite tournaments: Results and problems
- On cycles through a given vertex in multipartite tournaments
- Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- Generalizations of tournaments: A survey
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey