On multipartite tournaments

DOI10.1016/0095-8956(91)90069-VzbMath0736.05040WikidataQ105870501 ScholiaQ105870501MaRDI QIDQ1179479

Wayne Goddard, Songlin Tian, Ortrud R. Oellermann, Grzegorz M. Kubicki

Publication date: 26 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

multipartite tournamentslengths of cycles

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

The cycle structure of regular multipartite tournaments ⋮ The number of kings in a multipartite tournament ⋮ On \(k\)-strong and \(k\)-cyclic digraphs ⋮ On cycles through a given vertex in multipartite tournaments ⋮ Kings in bipartite tournaments ⋮ Kings in multipartite tournaments ⋮ Number of 4-kings in bipartite tournaments with no 3-kings ⋮ Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments ⋮ Competition periods of multipartite tournaments ⋮ On the 3-kings and 4-kings in multipartite tournaments ⋮ Multipartite tournaments: a survey ⋮ The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments ⋮ Circulant tournaments of prime order are tight ⋮ On multipartite tournament matrices with constant team size^∗ ⋮ Vertex deletion and cycles in multipartite tournaments ⋮ Semicomplete Multipartite Digraphs

Cites Work

• Cycles in bipartite tournaments
• The Theory of Round Robin Tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On multipartite tournaments