On multipartite tournaments

https://doi.org/10.1016/0095-8956(91)90069-VGet rights and content
Under an Elsevier user license
open archive

Abstract

An n-partite tournament, n≥2, or multipartite tournament is an oriented graph obtained by orienting each edge of a complete n-partite graph. The cycle structure of multipartite tournaments is investigated and properties of vertices with maximum score are studied.

Cited by (0)

Research supported in part by Office of Naval Research Contract N00014-88-K-0018.