All regular multipartite tournaments that are cycle complementary (Q1827717)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All regular multipartite tournaments that are cycle complementary |
scientific article |
Statements
All regular multipartite tournaments that are cycle complementary (English)
0 references
6 August 2004
0 references
A digraph \(D\) is cycle complementary if there are two disjoint cycles of \(D\) covering all vertices in \(D\). A complete \(c\)-partite tournament is an orientation of a complete \(c\)-partite graph. It is proved that, with two exceptions, every regular \(c\)-partite tournament (\(c\geq 3\)) of order at least 6 is cycle complementary.
0 references
regular multipartite tournament
0 references
cycle complementarity
0 references
digraph
0 references
0 references
0 references
