When \(n\)-cycles in \(n\)-partite tournaments are longest cycles

DOI10.1016/J.DISC.2004.10.007zbMath1055.05070OpenAlexW1968553077MaRDI QIDQ1763349

Arash Rafiey, Gregory Gutin

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

zbMATH Keywords

\(n\)-partite tournamentLongest cyclesShort cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Multipartite tournaments: a survey ⋮ Semicomplete Multipartite Digraphs

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

This page was built for publication: When \(n\)-cycles in \(n\)-partite tournaments are longest cycles