Cycles in multipartite tournaments: Results and problems (Q1348110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1741676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycles in multipartite tournaments: Results and problems |
scientific article; zbMATH DE number 1741676 |
Statements
Cycles in multipartite tournaments: Results and problems (English)
0 references
15 May 2002
0 references
In recent years a considerable amount of work has been done on cycles in multipartite tournaments. This paper is an extensive survey of this work. The results are classified in the following categories: cycles of all short lengths; long and longest cycles (here long and short refer to cycles whose length does or does not exceed the number of partite sets in the tournament); Hamiltonian cycles; pancyclic and vertex pancyclic multipartite tournaments; and Hamiltonian-connectedness and complementary cycles. The paper concludes with 120 references.
0 references
pancyclicity
0 references
multipartite tournaments
0 references
survey
0 references
Hamiltonian cycles
0 references
0.9237366914749146
0 references
0.8848749995231628
0 references
0.8737014532089233
0 references
0.8736354112625122
0 references
0.8697943091392517
0 references