Kings in \(k\)-partite tournaments

DOI10.1016/0012-365X(91)90380-KzbMath0751.05047MaRDI QIDQ1185101

Vojislav Petrovic, Carsten Thomassen

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

kings\(k\)-partite tournaments

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (18)

On the complexity of kings ⋮ The number of kings in a multipartite tournament ⋮ Kings in bipartite tournaments ⋮ Kings in multipartite tournaments ⋮ Number of 4-kings in bipartite tournaments with no 3-kings ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Kings in multipartite hypertournaments ⋮ On semicomplete multipartite digraphs whose king sets are semicomplete digraphs ⋮ On the 3-kings and 4-kings in multipartite tournaments ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ Kings in locally semicomplete digraphs ⋮ Multipartite tournaments: a survey ⋮ 3-kings in 3-partite tournaments ⋮ Kings in bipartite hypertournaments ⋮ Toppling kings in multipartite tournaments by introducing new kings ⋮ On the kings and kings-of-kings in semicomplete multipartite digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ Kings in quasi-transitive digraphs

Cites Work

• Cycles in digraphs– a survey
• Unnamed Item

This page was built for publication: Kings in \(k\)-partite tournaments