Multipartite tournaments: a survey (Q2463897): Difference between revisions

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.