Longest cycles in almost regular 3-partite tournaments
Let \(T\) be an almost regular 3-partite tournament with \(n\) nodes. Such a tournament need not have a spanning cycle; but the author shows, among other things, that every node in such a tournament belongs to a cycle of length of at least \(n-2\) and this result is best possible.
scientific article; zbMATH DE number 5083198
scientific article