Multipartite tournaments: a survey (Q2463897): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 08:13, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multipartite tournaments: a survey |
scientific article |
Statements
Multipartite tournaments: a survey (English)
0 references
6 December 2007
0 references
A multipartite tournament is an oriented complete \(c\)-partite graph for some \(c\geq 2\). This survey, containing 181 references, concentrates primarily on properties of paths and cycles in \(c\)-partite tournaments, mainly for \(c\geq 3\). Some of the section headings are as follows: Cycles whose length does not exceed the number of partite sets; Cycles through partite sets; Cycles and paths through arcs of all short lengths (i.e., not exceeding the number of partite sets); Long and longest paths and cycles; Hamiltonian cycles and paths; Pancyclic and vertex pancyclic multipartite tournaments; Cycles and path with a given number of vertices from each partite set; Complementary cycles; and Hamiltonian-connectedness.
0 references
multipartite tournaments
0 references
cycles
0 references
paths
0 references
connectivity
0 references
Hamiltonian cycles and paths
0 references
pancyclicity
0 references
complementary cycles
0 references