When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
type: Item
instance of: scholarly article
title: When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
zbMATH Open document ID: 1055.05070
author: G. Gutin
author: Arash Rafiey
published in: Discrete Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 2136229
zbMATH Keywords: \(n\)-partite tournament
zbMATH Keywords: Longest cycles
zbMATH Keywords: Short cycles
MaRDI profile type: Publication
full work available at URL: j.disc.2004.10.007
OpenAlex ID: W1968553077
cites work: Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
cites work: Generalizations of tournaments: A survey
cites work: Diconnected Orientations and a Conjecture of Las Vergnas
cites work: On cycles through a given vertex in multipartite tournaments
cites work: Q3220618
cites work: Q3826582
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: Longest paths in semicomplete multipartite digraphs
cites work: Cycles in multipartite tournaments: Results and problems
DOI: 10.1016/J.DISC.2004.10.007
Recommended article: On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
Recommended article: On \(n\)-partite tournaments with unique \(n\)-cycle
Recommended article: Cycles in multipartite tournaments: Results and problems
Recommended article: On cycles in multipartite tournaments
Recommended article: On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
Recommended article: Q4000792
Recommended article: Long cycles in bipartite tournaments
Recommended article: On cycles through a given vertex in multipartite tournaments
Recommended article: Q4215944
Recommended article: Q3720625
description: scientific article; zbMATH DE number 2136229